Sciweavers

5214 search results - page 22 / 1043
» The Online Specialization Problem
Sort
View
CIKM
2009
Springer
13 years 11 months ago
Provenance query evaluation: what's so special about it?
While provenance has been extensively studied in the literature, the efficient evaluation of provenance queries remains an open problem. Traditional query optimization techniques...
Anastasios Kementsietsidis, Min Wang
JSAT
2008
122views more  JSAT 2008»
13 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
MST
2008
157views more  MST 2008»
13 years 7 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot
ASPDAC
2008
ACM
87views Hardware» more  ASPDAC 2008»
13 years 9 months ago
An efficient performance improvement method utilizing specialized functional units in Behavioral Synthesis
This paper proposes a novel Behavioral Synthesis method that improves performance of synthesized circuits utilizing specialized functional units effectively. Specialized functional...
Tsuyoshi Sadakata, Yusuke Matsunaga
MFCS
1994
Springer
13 years 11 months ago
A Competitive Analysis of the List Update Problem with Lookahead
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
Susanne Albers