Sciweavers

160 search results - page 27 / 32
» Incremental Parallelization Using Navigational Programming: ...
Sort
View
AI
2002
Springer
13 years 7 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
OOPSLA
2005
Springer
14 years 1 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
MP
2007
145views more  MP 2007»
13 years 7 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
BMCBI
2006
199views more  BMCBI 2006»
13 years 7 months ago
PageMan: An interactive ontology tool to generate, display, and annotate overview graphs for profiling experiments
Background: Microarray technology has become a widely accepted and standardized tool in biology. The first microarray data analysis programs were developed to support pair-wise co...
Björn Usadel, Axel Nagel, Dirk Steinhauser, Y...
SIGSOFT
2005
ACM
14 years 8 months ago
Permissive interfaces
A modular program analysis considers components independently and provides succinct summaries for each component, which can be used when checking the rest of the system. Consider ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar