2304 search results - page 196 / 461 » On the Vulnerability of Large Graphs |
168
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
181
click to vote
GG
2004
Springer
15 years 12 months ago
2004
Springer
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
188
click to vote
CCGRID
2006
IEEE
15 years 10 months ago
2006
IEEE
Our current research into programming models for parallel web services composition is targeted at providing mechanisms for obtaining higher throughput for large scale compute and ...
182
click to vote
ENC
2004
IEEE
15 years 10 months ago
2004
IEEE
This article deals with the problem of data cache for dynamic web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is...
195
click to vote
AAAI
2000
15 years 8 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...