Sciweavers

327 search results - page 46 / 66
» A fully dynamic algorithm for planar
Sort
View
TOG
2008
163views more  TOG 2008»
13 years 7 months ago
Imperfect shadow maps for efficient computation of indirect illumination
We present a method for interactive computation of indirect illumination in large and fully dynamic scenes based on approximate visibility queries. While the high-frequency nature...
Tobias Ritschel, Thorsten Grosch, Min H. Kim, Hans...
AMAI
2004
Springer
14 years 1 months ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
MIDDLEWARE
2007
Springer
14 years 1 months ago
Garbage Collecting the Grid: A Complete DGC for Activities
Abstract. Grids are becoming more and more dynamic, running parallel applications on large scale and heterogeneous resources. Explicitly stopping a whole distributed application is...
Denis Caromel, Guillaume Chazarain, Ludovic Henrio
RTSS
2005
IEEE
14 years 1 months ago
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
Jian-Jia Chen, Tei-Wei Kuo
IWQOS
2001
Springer
14 years 5 days ago
QoS-Aware Adaptive Services in Mobile Ad-Hoc Networks
Ad-hoc wireless networks consist of mobile nodes interconnected by multi-hop wireless paths. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastru...
Baochun Li