88 search results - page 3 / 18 » Faster constraint solving with subtypes |
ICTAI
2010
IEEE
13 years 3 months ago
2010
IEEE
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
NETWORKS
2008
13 years 5 months ago
2008
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
IJMC
2006
13 years 5 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
EUROCAST
1994
Springer
13 years 9 months ago
1994
Springer
Logistic systems analysts use a wide array of modeling systems such as algebraic and logic programs. Two simple examples show how they mesh as Constraint Logic programs, emphasizin...