Sciweavers

7065 search results - page 996 / 1413
» Iterative Scheduling Algorithms
Sort
View
CORR
2010
Springer
83views Education» more  CORR 2010»
15 years 5 months ago
Multitriangulations, pseudotriangulations and primitive sorting networks
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
Vincent Pilaud, Michel Pocchiola
ICRA
2010
IEEE
149views Robotics» more  ICRA 2010»
15 years 5 months ago
Towards simplicial coverage repair for mobile robot teams
— In this note, we present initial results towards developing a distributed algorithm for repairing topological holes in the sensor cover of a mobile robot team. Central to our a...
Jason C. Derenick, Vijay Kumar, Ali Jadbabaie
INFOCOM
2010
IEEE
15 years 5 months ago
Distributed Resource Allocation for Synchronous Fork and Join Processing Networks
—Many emerging information processing applications require applying various fork and join type operations such as correlation, aggregation, and encoding/decoding to data streams ...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
JCO
2010
101views more  JCO 2010»
15 years 5 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
153
Voted
MP
2010
135views more  MP 2010»
15 years 5 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal