Sciweavers

19700 search results - page 128 / 3940
» DNA-Based Computation Times
Sort
View
FORMATS
2010
Springer
14 years 10 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...
130
Voted
JCST
2010
128views more  JCST 2010»
14 years 7 months ago
Queue Waiting Time Aware Dynamic Workflow Scheduling in Multicluster Environments
Abstract Workflows are prevailing in scientific computation. Multicluster environments emerge and provide more resources, benefiting workflows but also challenging the traditional ...
Zhi-Feng Yu, Wei-Song Shi
124
Voted
JCSS
2000
116views more  JCSS 2000»
15 years 18 days ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
130
Voted
EOR
2010
159views more  EOR 2010»
14 years 7 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin
CLUSTER
2007
IEEE
15 years 7 months ago
Optimal synchronization frequency for dynamic pipelined computations on heterogeneous systems
— In this paper we give a theoretical model for determining the synchronization frequency that minimizes the parallel execution time of loops with uniform dependencies dynamicall...
Florina M. Ciorba, Ioannis Riakiotakis, Theodore A...