1727 search results - page 326 / 346 » A Technique for Large Automated Mechanism Design Problems |
SODA
2012
ACM
13 years 9 days ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
160
click to vote
GIS
2005
ACM
15 years 11 months ago
2005
ACM
Numerous raster maps are available on the Internet, but the geographic coordinates of the maps are often unknown. In order to determine the precise location of a raster map, we ex...
102
click to vote
WWW
2005
ACM
15 years 10 months ago
2005
ACM
The demand for quickly delivering new applications is increasingly becoming a business imperative today. Application development is often done in an ad hoc manner, without standar...
AGENTS
2001
Springer
15 years 2 months ago
2001
Springer
In the software industry, designers are forever trying to “improve” their products by adding ever more features to them, producing bloated software systems that are capable of...
CCR
2000
14 years 9 months ago
2000
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...