Sciweavers

16596 search results - page 159 / 3320
» Generalized Assignment Problems
Sort
View
GECCO
2007
Springer
173views Optimization» more  GECCO 2007»
15 years 4 months ago
UCSpv: principled voting in UCS rule populations
Credit assignment is a fundamental issue for the Learning Classifier Systems literature. We engage in a detailed investigation of credit assignment in one recent system called UC...
Gavin Brown, Tim Kovacs, James A. R. Marshall
NIPS
2003
14 years 11 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller
DAM
2002
135views more  DAM 2002»
14 years 10 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
GIS
2007
ACM
15 years 11 months ago
Dynamic storage balancing in a distributed spatial index
We propose a general framework to index very large datasets of spatial data in a distributed system. Our proposal is built on the recently proposed Scalable Distributed Rtree (SD-...
Cédric du Mouza, Philippe Rigaux, Witold Li...
DAC
2005
ACM
15 years 11 months ago
Net weighting to reduce repeater counts during placement
We demonstrate how to use placement to ameliorate the predicted repeater explosion problem caused by poor interconnect scaling. We achieve repeater count reduction by dynamically ...
Brent Goplen, Prashant Saxena, Sachin S. Sapatneka...