Sciweavers

19130 search results - page 181 / 3826
» Modelling multi-path problems
Sort
View
CEC
2010
IEEE
15 years 4 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...
FSTTCS
2010
Springer
15 years 4 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang
DLOG
2011
14 years 10 months ago
On the Problem of Weighted Max-DL-SAT and its Application to Image Labeling
Abstract. For a number of problems, such as ontology learning or image labeling, we need to handle uncertainty and inconsistencies in an appropriate way. Fuzzy and Probabilistic De...
Stefan Scheglmann, Carsten Saathoff, Steffen Staab
CVPR
2005
IEEE
16 years 8 months ago
Shape from Shading: A Well-Posed Problem?
Shape From Shading is known to be an ill-posed problem. We show in this paper that if we model the problem in a different way than it is usually done, more precisely by taking int...
Emmanuel Prados, Olivier D. Faugeras
WWW
2008
ACM
16 years 7 months ago
Budget constrained bidding in keyword auctions and online knapsack problems
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Luko...