389 search results - page 49 / 78 » Some natural decision problems in automatic graphs |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
GECCO
2005
Springer
14 years 27 days ago
2005
Springer
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
CPAIOR
2010
Springer
13 years 5 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
AI
2006
Springer
13 years 7 months ago
2006
Springer
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...