Sciweavers

370 search results - page 22 / 74
» Independent Sets with Domination Constraints
Sort
View
BROADNETS
2005
IEEE
14 years 1 months ago
Performance analysis and enhancement for backbone based wireless mobile ad hoc networks
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
Laura Huei-jiun Ju, Izhak Rubin
ASPDAC
2008
ACM
154views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Automated techniques for energy efficient scheduling on homogeneous and heterogeneous chip multi-processor architectures
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...
Sushu Zhang, Karam S. Chatha
FOCS
2008
IEEE
14 years 1 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
MATES
2009
Springer
14 years 1 months ago
Concurrently Decomposable Constraint Systems
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
Cees Witteveen, Wiebe van der Hoek, Nico Roos
CA
2002
IEEE
14 years 11 days ago
Spacetime Sweeping: An Interactive Dynamic Constraints Solver
This paper presents a new method for editing an existing motion to satisfy a set of user-specified constraints, and in doing so guaranteeing the kinematic and dynamic soundness o...
Seyoon Tak, Oh-Young Song, Hyeong-Seok Ko