Sciweavers

1529 search results - page 20 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
FLAIRS
2007
13 years 10 months ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...
ECAI
2000
Springer
13 years 12 months ago
Focusing Search by Using Problem Solving Experience
Case-based reasoning (CBR) aims at using experience from the past in order to guide future problem solving rather than “starting from scratch” every time. We propose a CBR stra...
Eyke Hüllermeier
VIS
2006
IEEE
122views Visualization» more  VIS 2006»
14 years 8 months ago
Representing Higher-Order Singularities in Vector Fields on Piecewise Linear Surfaces
Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complet...
Wan-Chiu Li, Bruno Vallet, Nicolas Ray, Bruno L...
CDC
2009
IEEE
261views Control Systems» more  CDC 2009»
14 years 9 days ago
Stability and stabilization of a class of ill-conditioned second order differential linear repetitive processes
: This paper considers differential linear repetitive processes which are a distinct class of 2D systems whose dynamics evolve over a subset of the upper right quadrant of the 2D p...
Pawel Grzegorz Dabkowski, Krzysztof Galkowski, Eri...
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
13 years 7 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...