Publication

An assembly sequence generation algorithm using case-based search techniques

Publications associées (36)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On Induction for SMT Solvers

Viktor Kuncak, Andrew Joseph Reynolds

Satisfiability modulo theory solvers are increasingly being used to solve quantified formulas over structures such as integers and term algebras. Quantifier instantiation combined with ground decision procedure alone is insufficient to prove many formulas ...

2014

Learning search polices from humans in a partially observable context

Aude Billard, Guillaume Pierre Luc De Chambrier

Decision making and planning for which the state information is only partially available is a problem faced by all forms of intelligent entities they being either virtual, synthetic or biological. The standard approach to mathematically solve such a decisi ...

2014

Piercing quasi-rectangles-On a problem of Danzer and Rogers

János Pach, Gábor Tardos

It is an old problem of Danzer and Rogers to decide whether it is possible to arrange 0(1/epsilon) points in the unit square so that every rectangle of area epsilon > 0 within the unit square contains at least one of them. We show that the answer to this q ...

Elsevier2012

Content Search Through Comparisons

Amin Karbasi

We study the problem of navigating through a database of similar objects using comparisons under heterogeneous demand, a problem strongly related to small-world network design. We show that, under heterogeneous demand, the small-world network design proble ...

2011

Evolution of whole genomes through inversions

Krister Swenson

Advances in sequencing technology are yielding DNA sequence data at an alarming rate – a rate reminiscent of Moore's law. Biologists' abilities to analyze this data, however, have not kept pace. On the other hand, the discrete and mechanical nature of the ...

EPFL2009

Fractional Collections with Cardinality Bounds, and Mixed Integer Linear Arithmetic with Stars

Viktor Kuncak, Ruzica Piskac

We present decision procedures for logical constraints that support reasoning about collections of elements such as sets, multisets, and fuzzy sets. Element membership in such collections is given by a characteristic function from a finite universe (of unk ...

2008

Overcoming perceptual features in logical reasoning: an event-related potentials study

It is more difficult for reasoners to detect that the letter-number pair H7 verifies the conditional rule If there is not a T then there is not a 4 than to detect that it verifies the rule If there is an H then there is a 7. In prior work [Prado, J., & Nov ...

Elsevier2008

Decision Procedures for Multisets with Cardinality Constraints

Viktor Kuncak, Ruzica Piskac

Applications in software verification and interactive theorem proving often involve reasoning about sets of objects. Cardinality constraints on such collections also arise in these scenarios. Multisets arise for analogous reasons as sets: abstracting the c ...

Springer2008

Variable space search for graph coloring

Nicolas Zufferey, Matthieu Plumettaz

Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, ..., k}) to each vertex of G so that no edge has both endpoints with the same color. We propose a new local search methodology, ...

2008

Refining preference-based search results through Bayesian filtering

Pearl Pu Faltings, Jiyong Zhang

Preference-based search (PBS) is a popular approach for helping consumers find their desired items from online catalogs. Currently most PBS tools generate search results by a certain set of criteria based on preferences elicited from the current user durin ...

Association for Computing Machinery, New York, NY 10036-5701, United States2007