Sciweavers

784 search results - page 99 / 157
» Relaxing the Value Restriction
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 9 months ago
Where are the hard manipulation problems?
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...
Toby Walsh
IJCV
2006
161views more  IJCV 2006»
13 years 9 months ago
Discriminative Random Fields
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...
Sanjiv Kumar, Martial Hebert
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 years 9 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
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...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
COR
2004
139views more  COR 2004»
13 years 9 months ago
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
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...
Sin C. Ho, Dag Haugland
CMOT
2000
105views more  CMOT 2000»
13 years 9 months ago
Generation Supply Bidding in Perfectly Competitive Electricity Markets
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...
George Gross, David Finlay