299 search results - page 48 / 60 » DNA Computing for Complex Scheduling Problem |
88
Voted
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
We address the problem of multiclass object detection. Our aims are to enable models for new categories to benefit from the detectors built previously for other categories, and fo...
DIALM
2008
ACM
15 years 1 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
101
click to vote
RTSS
1992
IEEE
15 years 3 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
IJCAI
2001
15 years 1 months ago
2001
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...