Sciweavers

100 search results - page 19 / 20
» New complexity results for time-constrained dynamical optima...
Sort
View
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
14 years 18 days ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
CORR
2007
Springer
170views Education» more  CORR 2007»
13 years 7 months ago
Animation of virtual mannequins, robot-like simulation or motion captures
— In order to optimize the costs and time of design of the new products while improving their quality, concurrent engineering is based on the digital model of these products, the...
Damien Chablat
FORMATS
2008
Springer
13 years 9 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
AROBOTS
2008
77views more  AROBOTS 2008»
13 years 7 months ago
Extending obstacle avoidance methods through multiple parameter-space transformations
Obstacle avoidance methods approach the problem of mobile robot autonomous navigation by steering the robot in real-time according to the most recent sensor readings, being suitab...
Jose-Luis Blanco, Javier Gonzalez, Juan-Antonio Fe...
ICML
2010
IEEE
13 years 8 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein