44 search results - page 8 / 9 » A Complete Anytime Algorithm for Number Partitioning |
CVPR
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a new approach to appearance-based object recognition, which captures the relationships between multiple model views and exploits them to improve recognition performanc...
FMCAD
2009
Springer
14 years 17 days ago
2009
Springer
—Given an erroneous design, functional verification returns an error trace exhibiting a mismatch between the specification and the implementation of a design. Automated design ...
AAAI
2010
13 years 7 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
WADS
2007
Springer
14 years 3 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
ISCA
2005
IEEE
13 years 11 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...