1968 search results - page 393 / 394 » The Complexity of Valued Constraint Models |
KI
2008
Springer
13 years 6 months ago
2008
Springer
Many environments in which humans wayfind can be conveniently abstracted as networks or graphs: structures of nodes that are interconnected by edges. Examples include the street ne...
CCR
2008
13 years 5 months ago
2008
y be more complex than the course modeling abstraction we adopted in [2]. Real AS relationships may depend on a peering point, prefix, and even time [2]. For example, ISPs that dom...
SAT
2010
Springer
13 years 4 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
AISS
2010
13 years 1 months ago
2010
With the proliferation of the computer Cloud, new software delivery methods were created. In order to build software to fit into one of these models, a scalable, easy to deploy st...
TMC
2011
13 years 1 months ago
2011
—An energy-efficient, reliable and timely data transmission is essential for wireless sensor networks (WSNs) employed in scenarios where plant information must be available for ...