Sciweavers

2181 search results - page 84 / 437
» The restriction scaffold problem
Sort
View
SIGECOM
2009
ACM
83views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
The price of truthfulness for pay-per-click auctions
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...
Nikhil R. Devanur, Sham M. Kakade
ICRA
2007
IEEE
128views Robotics» more  ICRA 2007»
14 years 4 months ago
Adaptive Play Q-Learning with Initial Heuristic Approximation
Abstract— The problem of an effective coordination of multiple autonomous robots is one of the most important tasks of the modern robotics. In turn, it is well known that the lea...
Andriy Burkov, Brahim Chaib-draa
CP
2006
Springer
14 years 1 months ago
Approximability of Integer Programming with Generalised Constraints
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
VIROLOGY
2008
121views more  VIROLOGY 2008»
13 years 9 months ago
Constructing malware normalizers using term rewriting
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-pro...
Andrew Walenstein, Rachit Mathur, Mohamed R. Chouc...
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
14 years 2 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...