657 search results - page 101 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
AAAI
2010
15 years 1 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
121
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...
120
click to vote
CONSTRAINTS
2008
14 years 12 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
102
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
111
click to vote
ASPDAC
2009
ACM
15 years 6 months ago
2009
ACM
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...