Sciweavers

540 search results - page 33 / 108
» Competitive Routing over Time
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 9 months ago
On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stab...
Ankan Saha, Ambuj Tewari
PKDD
2009
Springer
155views Data Mining» more  PKDD 2009»
14 years 3 months ago
Dynamic Factor Graphs for Time Series Modeling
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
Piotr W. Mirowski, Yann LeCun
AIPS
2007
13 years 11 months ago
Online Planning for Resource Production in Real-Time Strategy Games
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...
Hei Chan, Alan Fern, Soumya Ray, Nick Wilson, Chri...
SIGCOMM
2010
ACM
13 years 9 months ago
Rethinking iBGP routing
The Internet is organized as a collection of administrative domains, known as Autonomous Systems (ASes). These ASes interact through the Border Gateway Protocol (BGP) that allows ...
Iuniana M. Oprescu, Mickael Meulle, Steve Uhlig, C...
IPL
2008
114views more  IPL 2008»
13 years 9 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura