Sciweavers

1522 search results - page 234 / 305
» Supporting Dynamic Process Specifications Using Communicatio...
Sort
View

Lecture Notes
1005views
16 years 10 months ago
Lectures on reconfigurable computing
Driven by recent innovations in Field-Programmable Gate Arrays (FPGAs), reconfigurable computing offers unique ways to accelerate key algorithms. FPGAs offer a programmable logic f...
Sherief Reda
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
15 years 4 months ago
Evolving explicit opponent models in game playing
Opponent models are necessary in games where the game state is only partially known to the player, since the player must infer the state of the game based on the opponent’s acti...
Alan J. Lockett, Charles L. Chen, Risto Miikkulain...
NGC
2000
Springer
109views Communications» more  NGC 2000»
15 years 1 months ago
Router level filtering for receiver interest delivery
Delivering data to on-line game participants requires the game data to be "customized" in real-time to each participant's characteristics. Using multicast in such a...
Manuel M. Oliveira, Jon Crowcroft, Christophe Diot
IJCAI
2003
14 years 11 months ago
A Method for Semantically Enhancing the Service Discovery Capabilities of UDDI
The promise of dynamic selection of business services and automatic integration of applications written to Web Services standards is yet to be realized. This is partially attribut...
Rama Akkiraju, Richard Goodwin, Prashant Doshi, Sa...
ICCV
2009
IEEE
14 years 7 months ago
Matching as a non-cooperative game
With this paper we offer a game-theoretic perspective for the all-pervasive matching problem in computer vision. Specifically, we formulate the matching problem as a (population) ...
Andrea Albarelli, Samuel Rota Bulò, Andrea ...