Sciweavers

274 search results - page 3 / 55
» Multi-goal economic search using dynamic search structures
Sort
View
COCOON
1998
Springer
13 years 11 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
SIGMETRICS
2008
ACM
135views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
In search of the elusive ground truth: the internet's as-level connectivity structure
Despite significant efforts to obtain an accurate picture of the Internet's actual connectivity structure at the level of individual autonomous systems (ASes), much has remai...
Ricardo V. Oliveira, Dan Pei, Walter Willinger, Be...
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
14 years 1 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
IJCAI
2001
13 years 9 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
IRREGULAR
1997
Springer
13 years 11 months ago
Parallel Shared-Memory State-Space Exploration in Stochastic Modeling
Stochastic modeling forms the basis for analysis in many areas, including biological and economic systems, as well as the performance and reliability modeling of computers and comm...
Susann C. Allmaier, Graham Horton