5606 search results - page 794 / 1122 » Randomization Techniques for Graphs. |
164
click to vote
AIPS
2008
15 years 9 months ago
2008
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
207
click to vote
ICWS
2008
IEEE
15 years 8 months ago
2008
IEEE
Service-oriented computing (SOC) has emerged as the eminent market environment for sharing and reusing service-centric capabilities. The underpinning for an organization's us...
150
click to vote
JAL
1998
15 years 6 months ago
1998
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
180
click to vote
PC
2007
15 years 6 months ago
2007
Physically based simulation of cloth in virtual environments is a computationally demanding problem. It involves modeling the internal material properties of the textile (physical...
212
click to vote
ECRTS
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...