784 search results - page 99 / 157 » Relaxing the Value Restriction |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
IJCV
2006
14 years 11 months ago
2006
In this research we address the problem of classification and labeling of regions given a single static natural image. Natural images exhibit strong spatial dependencies, and mode...
100
click to vote
ALGORITHMICA
2002
14 years 11 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
COR
2004
14 years 11 months ago
2004
The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle Routing Problems (VRP) arise in many real-life applications wit...
CMOT
2000
14 years 11 months ago
2000
This paper reports on the development of a comprehensive framework for the analysis and formulation of bids in competitive electricity markets. Competing entities submit offers of...