Sciweavers

2976 search results - page 555 / 596
» On the bounded integer programming
Sort
View
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
13 years 11 months ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...
IWMM
2000
Springer
113views Hardware» more  IWMM 2000»
13 years 11 months ago
On the Effectiveness of GC in Java
We study the effectiveness of garbage collection (GC) algorithms by measuring the time difference between the actual collection time of an object and the potential earliest collec...
Ran Shaham, Elliot K. Kolodner, Shmuel Sagiv
LICS
1997
IEEE
13 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
AIPS
2007
13 years 10 months ago
Robust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
Hoong Chuin Lau, Thomas Ou, Fei Xiao
ASAP
2010
IEEE
148views Hardware» more  ASAP 2010»
13 years 9 months ago
Function flattening for lease-based, information-leak-free systems
Recent research has proposed security-critical real-time embedded systems with provably-strong information containment through the use of hardware-enforced execution leases. Execut...
Xun Li, Mohit Tiwari, Timothy Sherwood, Frederic T...