Sciweavers

2354 search results - page 110 / 471
» Assignment Problems
Sort
View
110
Voted
GECCO
2004
Springer
145views Optimization» more  GECCO 2004»
15 years 7 months ago
Automated Extraction of Problem Structure
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
Anthony Bucci, Jordan B. Pollack, Edwin D. de Jong
ALGORITHMICA
2010
192views more  ALGORITHMICA 2010»
15 years 2 months ago
Circular Stable Matching and 3-way Kidney Transplant
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...
Chien-Chung Huang
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 7 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
FLAIRS
2007
15 years 4 months ago
Naive Bayes and Decision Trees for Function Tagging
This paper describes the use of two machine learning techniques, naive Bayes and decision trees, to address the task of assigning function tags to nodes in a syntactic parse tree....
Mihai C. Lintean, Vasile Rus
INFOCOM
2003
IEEE
15 years 7 months ago
Robust Monitoring of Link Delays and Faults in IP Networks
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
Yigal Bejerano, Rajeev Rastogi