Sciweavers

1461 search results - page 279 / 293
» Analysis of Constraint Logic Programs
Sort
View
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 2 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
CODES
2007
IEEE
14 years 2 months ago
Locality optimization in wireless applications
There is a strong need now for compilers of embedded systems to find effective ways of optimizing series of loop-nests, wherein majority of the memory references occur in the fo...
Javed Absar, Min Li, Praveen Raghavan, Andy Lambre...
ICAC
2006
IEEE
14 years 1 months ago
Enabling Self-Managing Applications using Model-based Online Control Strategies
— The increasing heterogeneity, dynamism, and uncertainty of emerging DCE (Distributed Computing Environment) systems imply that an application must be able to detect and adapt t...
Viraj Bhat, Manish Parashar, Hua Liu, Mohit Khande...
CP
2003
Springer
14 years 27 days ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
14 years 18 days ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle