Sciweavers

337 search results - page 26 / 68
» Semidefinite Programming Based Approximation Algorithms
Sort
View
CP
2004
Springer
15 years 10 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
SPIRE
2005
Springer
15 years 10 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
EAAI
2008
128views more  EAAI 2008»
15 years 4 months ago
Dual heuristic programming based nonlinear optimal control for a synchronous generator
This paper presents the design of an infinite horizon nonlinear optimal neurocontroller that replaces the conventional automatic voltage regulator and the turbine governor (CONVC)...
Jung-Wook Park, Ronald G. Harley, Ganesh K. Venaya...
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
15 years 10 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
ICLP
2007
Springer
15 years 10 months ago
Automatic Binding-Related Error Diagnosis in Logic Programs
Abstract. This paper proposes a diagnosis algorithm for locating a certain kind of errors in logic programs: variable binding errors that result act symptoms during compile-time ch...
Pawel Pietrzak, Manuel V. Hermenegildo