Sciweavers

838 search results - page 155 / 168
» Finding Optimal Solutions to Atomix
Sort
View
ATAL
2006
Springer
15 years 3 months ago
Learning the task allocation game
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
Sherief Abdallah, Victor R. Lesser
IDMS
1997
Springer
188views Multimedia» more  IDMS 1997»
15 years 3 months ago
An Approach for an Adaptive Visualization in a Mobile Environment
With the evolving availability of wireless communication servicesand of affordable mobile devices such as notebooks or Personal Digital Assistants, mobile computing is becoming wid...
Luc Neumann, Alberto Barbosa Raposo
ATAL
2008
Springer
15 years 1 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
SIROCCO
2010
15 years 1 months ago
Traffic Grooming in Star Networks via Matching Techniques
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
ESANN
2004
15 years 1 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...