378 search results - page 52 / 76 » How Many Ways Can One Draw a Graph |
122
click to vote
CP
2001
Springer
15 years 8 months ago
2001
Springer
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
170
Voted
DAMON
2008
Springer
15 years 5 months ago
2008
Springer
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
128
click to vote
ASIACRYPT
2010
Springer
15 years 1 months ago
2010
Springer
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
152
Voted
AAMAS
2012
Springer
13 years 11 months ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
153
Voted
GECCO
1999
Springer
15 years 7 months ago
1999
Springer
Genetic programming makes it possible to automatically search the space of possible programs. First we evolved a behavior-based control architecture using computer simulations. Th...