1197 search results - page 131 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ICWE
2004
Springer
14 years 1 months ago
2004
Springer
The recent trend in the Internet traffic is increasing in requests for dynamic and personalized content. To efficiently serve this trend, several serverside and cache-side fragme...
AI
2010
Springer
13 years 8 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
AGP
2003
IEEE
14 years 1 months ago
2003
IEEE
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...
ICCAD
2006
IEEE
14 years 5 months ago
2006
IEEE
Process variations cause different behavior of timingdependent effects across different chips. In this work, we analyze one example of timing-dependent effects, crosscoupling ...
ILP
2005
Springer
14 years 1 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...