Sciweavers

5263 search results - page 154 / 1053
» Optimization with Extremal Dynamics
Sort
View
IPCO
1993
98views Optimization» more  IPCO 1993»
15 years 17 days ago
A spectral approach to bandwidth and separator problems in graphs
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...
JGO
2010
89views more  JGO 2010»
14 years 9 months ago
Stopping rules in k-adaptive global random search algorithms
In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that are based on the use of statistical procedures. To bu...
Anatoly A. Zhigljavsky, Emily Hamilton
SIGSOFT
2010
ACM
14 years 9 months ago
Top ten ways to make formal methods for HPC practical
Almost all fundamental advances in science and engineering crucially depend on the availability of extremely capable high performance computing (HPC) systems. Future HPC systems w...
Ganesh Gopalakrishnan, Robert M. Kirby
IROS
2006
IEEE
105views Robotics» more  IROS 2006»
15 years 5 months ago
A Robocentric Motion Planner for Dynamic Environments Using the Velocity Space
— This paper addresses a method to optimize the robot motion planning in dynamic environments, avoiding the moving and static obstacles while the robot drives towards the goal. T...
Eduardo Owen, Luis Montano
IOR
2008
105views more  IOR 2008»
14 years 11 months ago
The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variat...
Grace Y. Lin, Yingdong Lu, David D. Yao