Sciweavers

1197 search results - page 126 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
ECOOP
2004
Springer
14 years 3 hour ago
A Reflective Approach to Dynamic Software Evolution
In this paper, we present a solution that allows systems to remain active while they are evolving. Our approach goes out from the principle of separated concerns and has two steps....
Peter Ebraert, Tom Tourwé
MOBICOM
2006
ACM
14 years 2 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
INFOCOM
2002
IEEE
14 years 1 months ago
Optimal Rate Allocation and Traffic Splits for Energy Efficient Routing in Ad Hoc Networks
Abstract— In this paper, we address the problem of providing traffic quality of service and energy efficiency in ad hoc wireless networks. We consider a network that is shared ...
Vikram Srinivasan, Carla-Fabiana Chiasserini, Pava...
EMMCVPR
2007
Springer
14 years 5 days ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
SIAMIS
2011
13 years 3 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...