Sciweavers

2393 search results - page 199 / 479
» Bounds-Consistent Local Search
Sort
View
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
15 years 8 months ago
Ant System for the k-Cardinality Tree Problem
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
Thang Nguyen Bui, Gnanasekaran Sundarraj
CSC
2008
15 years 4 months ago
Multilevel Approaches applied to the Capacitated Clustering Problem
- This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aidin...
Demane Rodney, Alan Soper, Chris Walshaw
98
Voted
AMC
2008
88views more  AMC 2008»
15 years 3 months ago
Stopping rules for box-constrained stochastic global optimization
We present three new stopping rules for Multistart based methods. The first uses a device that enables the determination of the coverage of the bounded search domain. The second i...
Isaac E. Lagaris, Ioannis G. Tsoulos
COGSCI
2011
49views more  COGSCI 2011»
14 years 10 months ago
What a Rational Parser Would Do
This article examines cognitive process models of human sentence comprehension based on the idea of informed search. These models are rational in the sense that they strive to qui...
John T. Hale
CVPR
2009
IEEE
16 years 11 months ago
Recognizing Linked Events: Searching the Space of Feasible Explanations
The ambiguity inherent in a localized analysis of events from video can be resolved by exploiting constraints between events and examining only feasible global explanations. We sho...
Dima Damen (University of Leeds), David Hogg (Univ...