Sciweavers

23988 search results - page 4493 / 4798
» Social Network Computing
Sort
View
FSTTCS
2009
Springer
15 years 11 months ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
GECCO
2009
Springer
135views Optimization» more  GECCO 2009»
15 years 11 months ago
Neuroevolutionary reinforcement learning for generalized helicopter control
Helicopter hovering is an important challenge problem in the field of reinforcement learning. This paper considers several neuroevolutionary approaches to discovering robust cont...
Rogier Koppejan, Shimon Whiteson
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 11 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
ICANN
2009
Springer
15 years 11 months ago
Multimodal Sparse Features for Object Detection
In this paper the sparse coding principle is employed for the representation of multimodal image data, i.e. image intensity and range. We estimate an image basis for frontal face i...
Martin Haker, Thomas Martinetz, Erhardt Barth
IFM
2009
Springer
107views Formal Methods» more  IFM 2009»
15 years 11 months ago
Realizability of Choreographies Using Process Algebra Encodings
Abstract. Service-oriented computing has emerged as a new programming paradigm that aims at implementing software applications which can be used through a network via the exchange ...
Gwen Salaün, Tevfik Bultan
« Prev « First page 4493 / 4798 Last » Next »