Sciweavers

457 search results - page 46 / 92
» Upper and Lower Bounds on Continuous-Time Computation
Sort
View
CCGRID
2009
IEEE
16 years 26 days ago
Modeling Job Lifespan Delays in Volunteer Computing Projects
Volunteer Computing (VC) projects harness the power of computers owned by volunteers across the Internet to perform hundreds of thousands of independent jobs. In VC projects, the ...
Trilce Estrada, Michela Taufer, Kevin Reed
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 11 months ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu
IPPS
1999
IEEE
15 years 10 months ago
A Network Status Predictor to Support Dynamic Scheduling in Network-Based Computing Systems
The management of networks has often been ignored in network-based computing systems due to the difficulty of estimating application programs' network latency and bandwidth r...
JunSeong Kim, David J. Lilja
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
15 years 6 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
16 years 21 days ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur