Sciweavers

19700 search results - page 66 / 3940
» DNA-Based Computation Times
Sort
View
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
13 years 1 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
COMPSAC
2011
IEEE
12 years 9 months ago
Dynamic Request Management Algorithms for Web-Based Services in Cloud Computing
—Providers of Web-based services can take advantage of many convenient features of cloud computing infrastructures, but they still have to implement request management algorithms...
Riccardo Lancellotti, Mauro Andreolini, Claudia Ca...
TCAD
1998
95views more  TCAD 1998»
13 years 9 months ago
A framework for comparing models of computation
—We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general term...
Edward A. Lee, Alberto L. Sangiovanni-Vincentelli
HPDC
2011
IEEE
13 years 1 months ago
Juggle: proactive load balancing on multicore computers
We investigate proactive dynamic load balancing on multicore systems, in which threads are continually migrated to reduce the impact of processor/thread mismatches to enhance the ...
Steven Hofmeyr, Juan A. Colmenares, Costin Iancu, ...
ATMOS
2010
130views Optimization» more  ATMOS 2010»
13 years 9 months ago
Fast Detour Computation for Ride Sharing
Today’s ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So...
Robert Geisberger, Dennis Luxen, Sabine Neubauer, ...