Sciweavers

7978 search results - page 1470 / 1596
» Combining shared-coin algorithms
Sort
View
AI
2000
Springer
14 years 9 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
IDA
2002
Springer
14 years 9 months ago
Evolutionary model selection in unsupervised learning
Feature subset selection is important not only for the insight gained from determining relevant modeling variables but also for the improved understandability, scalability, and pos...
YongSeog Kim, W. Nick Street, Filippo Menczer
IM
2007
14 years 9 months ago
Cluster Generation and Labeling for Web Snippets: A Fast, Accurate Hierarchical Solution
This paper describes Armil, a meta-search engine that groups the web snippets returned by auxiliary search engines into disjoint labeled clusters. The cluster labels generated by A...
Filippo Geraci, Marco Pellegrini, Marco Maggini, F...
COMCOM
1998
83views more  COMCOM 1998»
14 years 9 months ago
System for screening objectionable images
As computers and Internet become more and more available to families, access of objectionable graphics by children is increasingly a problem that many parents are concerned about....
James Ze Wang, Jia Li, Gio Wiederhold, Oscar Firsc...
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
14 years 9 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
« Prev « First page 1470 / 1596 Last » Next »