Sciweavers

452 search results - page 50 / 91
» Finding bugs is easy
Sort
View
GECCO
2004
Springer
138views Optimization» more  GECCO 2004»
14 years 1 months ago
Exploratory Data Analysis with Interactive Evolution
We illustrate with two simple examples how Interactive Evolutionary Computation (IEC) can be applied to Exploratory Data Analysis (EDA). IEC is particularly valuable in an EDA cont...
Sergey Malinchik, Eric Bonabeau
AH
2006
Springer
13 years 11 months ago
A Comparative Study of Compound Critique Generation in Conversational Recommender Systems
Abstract. Critiquing techniques provide an easy way for users to feedback their preferences over one or several attributes of the products in a conversational recommender system. W...
Jiyong Zhang, Pearl Pu
AAAI
1996
13 years 9 months ago
An Optimal Contracting Strategy in a Digital Library
Agents can benefit from contracting some of their tasks that cannot be performedby themselves or that can be performed moreefficiently by other agents. Developing an agent's ...
Sunju Park, Edmund H. Durfee
AAAI
1990
13 years 9 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
IPL
2006
115views more  IPL 2006»
13 years 8 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel