Sciweavers

595 search results - page 7 / 119
» A Constraint Programming Approach for Solving a Queueing Con...
Sort
View
IJCAI
1989
13 years 8 months ago
An Algebraic Approach to Constraint Satisfaction Problems
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
Igor Rivin, Ramin Zabih
IROS
2008
IEEE
122views Robotics» more  IROS 2008»
14 years 1 months ago
A probabilistic Programming by Demonstration framework handling constraints in joint space and task space
— We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a Programming by Demonstration (PbD) framework and for ge...
Sylvain Calinon, Aude Billard
TWC
2010
13 years 2 months ago
Delay-Minimal Transmission for Average Power Constrained Multi-Access Communications
We investigate the problem of minimizing the overall transmission delay of packets in a multi-access wireless communication system, where the transmitters have average power constr...
Jing Yang, Sennur Ulukus
TASLP
2010
78views more  TASLP 2010»
13 years 2 months ago
Solving Demodulation as an Optimization Problem
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...
Gregory Sell, Malcolm Slaney
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
14 years 1 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller