Sciweavers

1662 search results - page 203 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ANOR
2010
102views more  ANOR 2010»
13 years 9 months ago
Ejection chain and filter-and-fan methods in combinatorial optimization
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
César Rego, Fred Glover
ATAL
2004
Springer
14 years 2 months ago
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
We present GAMUT1 , a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationshi...
Eugene Nudelman, Jennifer Wortman, Yoav Shoham, Ke...
JSAC
2010
77views more  JSAC 2010»
13 years 7 months ago
MMS: An autonomic network-layer foundation for network management
Abstract—Networks cannot be managed without communication among geographically distributed network devices and control agents. Unfortunately, computer networks today lack an auto...
Hemant Gogineni, Albert G. Greenberg, David A. Mal...
AAAI
2006
13 years 10 months ago
Learning Systems of Concepts with an Infinite Relational Model
Relationships between concepts account for a large proportion of semantic knowledge. We present a nonparametric Bayesian model that discovers systems of related concepts. Given da...
Charles Kemp, Joshua B. Tenenbaum, Thomas L. Griff...
SIGSOFT
2010
ACM
13 years 6 months ago
Building scalable software systems in the multicore era
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...
Hridesh Rajan