Sciweavers

3630 search results - page 721 / 726
» Fast Marching Methods
Sort
View
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 6 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
SOCO
2010
Springer
13 years 6 months ago
Automatic detection of trends in time-stamped sequences: an evolutionary approach
This paper presents an evolutionary algorithm for modeling the arrival dates in time-stamped data sequences such as newscasts, e-mails, IRC conversations, scientific journal artic...
Lourdes Araujo, Juan Julián Merelo Guerv&oa...
CASCON
2010
174views Education» more  CASCON 2010»
13 years 5 months ago
Smart Services Across the Real and Virtual Worlds
Today, we are witnessing a new level of scale, complexity, and pervasiveness of software systems that are designed to support much more holistically complex processes. Much richer...
Eleni Stroulia
ICRA
2010
IEEE
178views Robotics» more  ICRA 2010»
13 years 5 months ago
Biomimetic optic flow sensing applied to a lunar landing scenario
Autonomous landing on unknown extraterrestrial bodies requires fast, noise-resistant motion processing to elicit appropriate steering commands. Flying insects excellently master vi...
Florent Valette, Franck Ruffier, Stéphane V...
PIMRC
2010
IEEE
13 years 5 months ago
Cooperative interference-aware joint scheduling for the 3GPP LTE uplink
In current cellular networks base stations (BSs) usually perform independent scheduling without coordinating the resource allocation among different cells. This, however, often lea...
Philipp Frank, Andreas Müller 0001, Heinz Dro...