Sciweavers

4810 search results - page 830 / 962
» Modeling Value Speculation
Sort
View
COR
2008
99views more  COR 2008»
15 years 6 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
CORR
2008
Springer
189views Education» more  CORR 2008»
15 years 6 months ago
Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli
CORR
2008
Springer
127views Education» more  CORR 2008»
15 years 6 months ago
On the long time behavior of the TCP window size process
The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process t...
Djalil Chafaï, Florent Malrieu, Katy Paroux
DEBU
2008
165views more  DEBU 2008»
15 years 6 months ago
A Survey of Attack-Resistant Collaborative Filtering Algorithms
With the increasing popularity of recommender systems in commercial services, the quality of recommendations has increasingly become an important to study, much like the quality o...
Bhaskar Mehta, Thomas Hofmann
AI
2006
Springer
15 years 6 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne