2109 search results - page 253 / 422 » Solving Necklace Constraint Problems |
185
click to vote
IJCAI
2003
15 years 8 months ago
2003
Traditional single-agent search algorithms usually make simplifying assumptions (single search agent, stationary target, complete knowledge of the state, and sufficient time). The...
174
Voted
CAD
2007
Springer
15 years 7 months ago
2007
Springer
This paper presents a global optimization operator for arbitrary meshes. The global optimization operator is composed of two main terms, one part is the global Laplacian operator ...
194
Voted
ICIP
2009
IEEE
16 years 8 months ago
2009
IEEE
We propose a method to demosaick images acquired with a completely arbitrary color filter array (CFA). We adopt a variational approach where the reconstructed image has maximal sm...
172
Voted
AGILEDC
2007
IEEE
16 years 1 months ago
2007
IEEE
A complex Enterprise Relationship Planning (ERP) data migration was in trouble: low quality, poor performance, instability, and an overworked team threatened project success. Faci...
166
Voted
FOIKS
2008
Springer
15 years 8 months ago
2008
Springer
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...