Sciweavers

15485 search results - page 2947 / 3097
» Computing Optimal Subsets
Sort
View
136
Voted
EUROPAR
1997
Springer
15 years 6 months ago
Modulo Scheduling with Cache Reuse Information
Instruction scheduling in general, and software pipelining in particular face the di cult task of scheduling operations in the presence of uncertain latencies. The largest contrib...
Chen Ding, Steve Carr, Philip H. Sweany
94
Voted
FOCS
1993
IEEE
15 years 6 months ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
145
Voted
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 6 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
KR
1992
Springer
15 years 6 months ago
Embedding Defaults into Terminological Knowledge Representation Formalisms
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
Franz Baader, Bernhard Hollunder
131
Voted
ACMICEC
2007
ACM
201views ECommerce» more  ACMICEC 2007»
15 years 6 months ago
Bid based scheduler with backfilling for a multiprocessor system
We consider a virtual computing environment that provides computational resources on demand to users with multiattribute task descriptions that include a valuation, resource (CPU)...
Inbal Yahav, Louiqa Raschid, Henrique Andrade
« Prev « First page 2947 / 3097 Last » Next »