540 search results - page 67 / 108 » Competitive Routing over Time |
ICML
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...
IJCNN
2007
IEEE
14 years 4 months ago
2007
IEEE
— In the process of learning a pattern I, the Fuzzy ARTMAP algorithm templates (i.e., the weight vectors corresponding to nodes of its category representation layer) compete for ...
AIMSA
2008
Springer
14 years 5 days ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
AIPS
2000
13 years 11 months ago
2000
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
IOR
2010
13 years 8 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...