Sciweavers

3049 search results - page 239 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
SIAMJO
2000
108views more  SIAMJO 2000»
15 years 6 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
MASCOTS
2007
15 years 8 months ago
Distance Reduction in Mobile Wireless Communication: Lower Bound Analysis and Practical Attainment
— The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be explo...
Yu Dong, Wing-Kai Hon, David K. Y. Yau, Jren-Chit ...
ICCD
2004
IEEE
103views Hardware» more  ICCD 2004»
16 years 3 months ago
A Two-Layer Bus Routing Algorithm for High-Speed Boards
The increasing clock frequencies in high-end industrial circuits bring new routing challenges that can not be handled by traditional algorithms. An important design automation pro...
Muhammet Mustafa Ozdal, Martin D. F. Wong
SECON
2007
IEEE
16 years 25 days ago
Approximation Algorithm for Base Station Placement in Wireless Sensor Networks
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
Yi Shi, Yiwei Thomas Hou
AIPS
2008
15 years 9 months ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell