Sciweavers

4335 search results - page 429 / 867
» Privatizing Constraint Optimization
Sort
View
ICPR
2008
IEEE
16 years 21 days ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov
INFOCOM
2006
IEEE
16 years 9 days ago
Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
Abstract— This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constrai...
Lijun Chen, Steven H. Low, Mung Chiang, John C. Do...
ICRA
2003
IEEE
114views Robotics» more  ICRA 2003»
15 years 11 months ago
Robotic catching using a direct mapping from visual information to motor command
— In this paper a robotic catching algorithm based on a nonlinear mapping of visual information to the desired trajectory is proposed. The nonlinear mapping is optimized by learn...
Akio Namiki, Masatoshi Ishikawa
CP
2003
Springer
15 years 11 months ago
Semi-independent Partitioning: A Method for Bounding the Solution to COP's
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
David Larkin
SNPD
2003
15 years 7 months ago
Deductive and Inductive Methods for Program Synthesis
The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of d...
Jaan Penjam, Elena Sanko