Sciweavers

5331 search results - page 989 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
CF
2005
ACM
15 years 3 months ago
On the energy-efficiency of speculative hardware
Microprocessor trends are moving towards wider architectures and more aggressive speculation. With the increasing transistor budgets, energy consumption has become a critical desi...
Nana B. Sam, Martin Burtscher
AAAI
2010
15 years 3 months ago
Security Games with Arbitrary Schedules: A Branch and Price Approach
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
Manish Jain, Erim Kardes, Christopher Kiekintveld,...
NETWORKING
2010
15 years 3 months ago
Server Guaranteed Cap: An Incentive Mechanism for Maximizing Streaming Quality in Heterogeneous Overlays
We address the problem of maximizing the social welfare in a peer-to-peer streaming overlay given a fixed amount of server upload capacity. We show that peers' selfish behavio...
Ilias Chatzidrossos, György Dán, Vikt&...
IPCO
2008
118views Optimization» more  IPCO 2008»
15 years 3 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
NETWORKING
2008
15 years 3 months ago
On the Applicability of Knowledge Based NAT-Traversal for Home Networks
The presence of Network Address Translation (NAT) is a hindrance when accessing services within home networks, because NAT breaks the end-to-end connectivity model of the Internet ...
Andreas Müller, Andreas Klenk, Georg Carle