12015 search results - page 517 / 2403 » Interactive Algorithms 2005 |
123
click to vote
RT
2005
Springer
15 years 10 months ago
2005
Springer
Fast global illumination computation is a challenge in several fields such as lighting simulation and computergenerated visual effects for movies. To this end, the irradiance cac...
110
Voted
SPIN
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The most expensive operation in explicit state model checking is the hash computation required to store the explored states in a hash table. One way to reduce this comput...
162
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
111
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
142
click to vote
COR
2006
15 years 5 months ago
2006
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...