Sciweavers

1068 search results - page 198 / 214
» On Space Bounded Server Algorithms
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Evaluating hybrid constraint tightening for scheduling agents
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
James C. Boerkoel Jr., Edmund H. Durfee
COMPGEOM
2003
ACM
14 years 26 days ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
ICIP
1994
IEEE
13 years 11 months ago
Total Variation Based Image Restoration with Free Local Constraints
The two main plagues of image restoration are oscillations and smoothing. Traditional image restoration techniques prevent parasitic oscillations by resorting to smooth regulariza...
Leonid I. Rudin, Stanley Osher
IWMM
2010
Springer
211views Hardware» more  IWMM 2010»
13 years 9 months ago
Concurrent, parallel, real-time garbage-collection
With the current developments in CPU implementations, it becomes obvious that ever more parallel multicore systems will be used even in embedded controllers that require real-time...
Fridtjof Siebert
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 7 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia