Sciweavers

4266 search results - page 262 / 854
» The container loading problem
Sort
View
AI
2010
Springer
15 years 4 months ago
AllDifferent-based filtering for subgraph isomorphism
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
Christine Solnon
ANOR
2008
69views more  ANOR 2008»
15 years 4 months ago
NP-hardness results for the aggregation of linear orders into median orders
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
Olivier Hudry
JDA
2007
135views more  JDA 2007»
15 years 4 months ago
Cache placement in sensor networks under an update cost constraint
In this paper, we address an optimization problem that arises in the context of cache placement in sensor networks. In particular, we consider the cache placement problem where th...
Bin Tang, Himanshu Gupta
ARSCOM
2004
75views more  ARSCOM 2004»
15 years 4 months ago
On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
Stefan Szeider
137
Voted
INFFUS
2000
122views more  INFFUS 2000»
15 years 4 months ago
Multi-modal identity verification using expert fusion
The contribution of this paper is to compare paradigms coming from the classes of parametric, and non-parametric techniques to solve the decision fusion problem encountered in the...
Patrick Verlinde, Gérard Chollet, Marc Ache...