717 search results - page 66 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
113
click to vote
IWPC
2000
IEEE
15 years 6 months ago
2000
IEEE
This paper presents a framework for software architecture recovery and restructuring. The user specifies a high level abstraction view of the system using a structured pattern la...
106
click to vote
IJMC
2006
15 years 1 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 ...
139
click to vote
ENTCS
2007
15 years 1 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
130
click to vote
PPSN
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
111
click to vote
AAAI
2004
15 years 2 months ago
2004
In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a sub...