Sciweavers

1568 search results - page 54 / 314
» The problem of examination questions in algorithmics
Sort
View
HEURISTICS
2000
90views more  HEURISTICS 2000»
14 years 10 months ago
Tabu Search for a Network Loading Problem with Multiple Facilities
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...
David Berger, Bernard Gendron, Jean-Yves Potvin, S...
77
Voted
IPMU
2010
Springer
15 years 4 days ago
The Link Prediction Problem in Bipartite Networks
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
Jérôme Kunegis, Ernesto William De Lu...
63
Voted
FOCS
2005
IEEE
15 years 3 months ago
Mechanism Design via Machine Learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
AAAI
2000
14 years 11 months ago
Making Rational Decisions Using Adaptive Utility Elicitation
Rational decision making requires full knowledge of the utility function of the person affected by the decisions. However, in many cases, the task of acquiring such knowledge is n...
Urszula Chajewska, Daphne Koller, Ronald Parr
93
Voted
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
15 years 7 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...