Sciweavers

1566 search results - page 103 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
CP
2001
Springer
14 years 21 days ago
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
Rina Dechter, Kalev Kask, Javier Larrosa
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 9 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
JUCS
2007
122views more  JUCS 2007»
13 years 8 months ago
Efficient Access Methods for Temporal Interval Queries of Video Metadata
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...
Spyros Sioutas, Kostas Tsichlas, Bill Vassiliadis,...
CACM
2010
140views more  CACM 2010»
13 years 5 months ago
FastTrack: efficient and precise dynamic race detection
Multithreaded programs are notoriously prone to race conditions. Prior work on dynamic race detectors includes fast but imprecise race detectors that report false alarms, as well ...
Cormac Flanagan, Stephen N. Freund
WSC
2004
13 years 9 months ago
A New Method to Determine the Tool Count of a Semiconductor Factory Using FabSim
Tool count optimization is mandatory for an efficiently organized semiconductor factory. This paper describes an efficient heuristic to determine the tool count using the compact ...
Holger Vogt