Sciweavers

1405 search results - page 113 / 281
» Popularity at Minimum Cost
Sort
View
DAM
1999
132views more  DAM 1999»
15 years 4 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
IANDC
2010
67views more  IANDC 2010»
15 years 3 months ago
Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
Nadja Betzler, Jiong Guo, Rolf Niedermeier
126
Voted
IJAIT
2010
167views more  IJAIT 2010»
15 years 2 months ago
Bee Colony Optimization with Local Search for Traveling Salesman Problem
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
Li-Pei Wong, Malcolm Yoke-Hean Low, Chin Soon Chon...
JUCS
2010
143views more  JUCS 2010»
15 years 2 months ago
Design of Arbiters and Allocators Based on Multi-Terminal BDDs
: Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways...
Václav Dvorák, Petr Mikusek
ICIP
2010
IEEE
15 years 2 months ago
Stereoscopic content production of complex dynamic scenes using a wide-baseline monoscopic camera set-up
Conventional stereoscopic video content production requires use of dedicated stereo camera rigs which is both costly and lacking video editing flexibility. In this paper, we propo...
Jean-Yves Guillemaut, Muhammad Sarim, Adrian Hilto...