Sciweavers

1316 search results - page 211 / 264
» A New Scheduling Algorithm for Servers
Sort
View
FMSB
2008
199views Formal Methods» more  FMSB 2008»
13 years 10 months ago
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
Jasmin Fisher, Thomas A. Henzinger, Maria Mateescu...
ICALP
2009
Springer
14 years 3 months ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
14 years 9 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
14 years 21 days ago
Smart crossover operator with multiple parents for a Pittsburgh learning classifier system
This paper proposes a new smart crossover operator for a Pittsburgh Learning Classifier System. This operator, unlike other recent LCS approaches of smart recombination, does not ...
Jaume Bacardit, Natalio Krasnogor
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
14 years 9 months ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler