Sciweavers

3678 search results - page 25 / 736
» On the Stable Paths Problem
Sort
View
AMAI
1999
Springer
13 years 9 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
SAC
2005
ACM
14 years 3 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
CG
2005
Springer
13 years 9 months ago
Sketch-based free-form shape modelling with a fast and stable numerical engine
In this paper, we present a feature-based free-form shape modelling technique based on solving a fundamental problem of reconstructing the depth information from 2D sketch planes....
Yong-Jin Liu, Kai Tang, Ajay Joneja
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
14 years 3 months ago
Tournament Selection: Stable Fitness Pressure in XCS
Abstract. Although it is known from GA literature that proportionate selection is subject to many pitfalls, the LCS community somewhat adhered to proportionate selection. Also in t...
Martin Butz, Kumara Sastry, David E. Goldberg
MFCS
2009
Springer
14 years 4 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...