Sciweavers

9810 search results - page 275 / 1962
» Problems, Descriptions and Objects
Sort
View
GECCO
2004
Springer
145views Optimization» more  GECCO 2004»
15 years 11 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
KDD
2009
ACM
237views Data Mining» more  KDD 2009»
16 years 6 months ago
Exploring social tagging graph for web object classification
This paper studies web object classification problem with the novel exploration of social tags. Automatically classifying web objects into manageable semantic categories has long ...
Zhijun Yin, Rui Li, Qiaozhu Mei, Jiawei Han
IFIP
2004
Springer
15 years 11 months ago
Truthful Mechanisms for Generalized Utilitarian Problems
In this paper we investigate extensions of the well-known Vickrey-Clarke-Groves (VCG) mechanisms to problems whose objective function is not utilitarian and whose agents’ utiliti...
Giovanna Melideo, Paolo Penna, Guido Proietti, Rog...
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
15 years 10 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria
JAIR
2007
141views more  JAIR 2007»
15 years 5 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf