Sciweavers

1022 search results - page 48 / 205
» Challenges for Constraint Programming in Networking
Sort
View
CONCURRENCY
2000
99views more  CONCURRENCY 2000»
15 years 11 days ago
The Java memory model is fatally flawed
The Java memory model described in Chapter 17 of the Java Language Specification gives constraints on how threads interact through memory. This chapter is hard to interpret and po...
William Pugh
108
Voted
JCO
2006
64views more  JCO 2006»
15 years 15 days ago
Traffic engineering of tunnel-based networks with class specific diversity requirements
Tunnel-based networks such as Multi-protocol Label switching (MPLS) are suitable for providing diversity guarantees to different service classes or customers. Based on the number ...
Shekhar Srivastava, Deep Medhi
80
Voted
GLOBECOM
2008
IEEE
15 years 7 months ago
Outage-Based Rate Maximization in CDMA Wireless Networks
—The problem of maximizing the sum of the transmit rates while limiting the outage probability below an appropriate threshold is investigated for networks where the nodes have li...
M. D'Angelo, Carlo Fischione, Matteo Butussi, Ales...
ATAL
2009
Springer
15 years 7 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
124
Voted
ANNPR
2006
Springer
15 years 4 months ago
Fast Training of Linear Programming Support Vector Machines Using Decomposition Techniques
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
Yusuke Torii, Shigeo Abe