Sciweavers

2620 search results - page 137 / 524
» An Evaluation Technique for Binarization Algorithms
Sort
View
UIST
1994
ACM
14 years 3 days ago
Evolutionary Learning of Graph Layout Constraints from Examples
We propose a new evolutionary method of extracting user preferences from examples shown to an automatic graph layout system. Using stochastic methods such as simulated annealing a...
Toshiyuki Masui
ADC
2008
Springer
112views Database» more  ADC 2008»
14 years 2 months ago
Semantics based Buffer Reduction for Queries over XML Data Streams
With respect to current methods for query evaluation over XML data streams, adoption of certain types of buffering techniques is unavoidable. Under lots of circumstances, the buff...
Chi Yang, Chengfei Liu, Jianxin Li, Jeffrey Xu Yu,...
ICAIL
2003
ACM
14 years 1 months ago
Predicting Outcomes of Case-Based Legal Arguments
In this paper, we introduce IBP, an algorithm that combines g with an abstract domain model and case-based reasoning techniques to predict the outcome of case-based legal argument...
Stefanie Brüninghaus, Kevin D. Ashley
CEC
2008
IEEE
14 years 2 months ago
Increasing rule extraction accuracy by post-processing GP trees
—Genetic programming (GP), is a very general and efficient technique, often capable of outperforming more specialized techniques on a variety of tasks. In this paper, we suggest ...
Ulf Johansson, Rikard König, Tuve Löfstr...
CSCLP
2007
Springer
14 years 2 months ago
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
Pavel Surynek