Sciweavers

3946 search results - page 194 / 790
» The computational complexity of choice sets
Sort
View
COORDINATION
2004
Springer
16 years 17 hour ago
A Lightweight Coordination Middleware for Mobile Computing
This paper presents Limone, a new coordination model that facilitates rapid application development over ad hoc networks consisting of logically mobile agents and physically mobile...
Chien-Liang Fok, Gruia-Catalin Roman, Gregory Hack...
RTCSA
2000
IEEE
15 years 11 months ago
Scheduling optional computations in fault-tolerant real-time systems
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
Pedro Mejía-Alvarez, Hakan Aydin, Daniel Mo...
AAAI
2010
15 years 8 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi
WSC
2004
15 years 8 months ago
Poly-Functional Intelligent Agents for Computer Generated Forces
The authors present the requirement definition and methodological approach for developing a new generation of Computer Generated Forces (CGF) based on Intelligent Agents. The anal...
Matteo Brandolini, Attilio Rocca, Agostino G. Bruz...
ICASSP
2011
IEEE
14 years 10 months ago
Sparse common spatial patterns in brain computer interface applications
The Common Spatial Pattern (CSP) method is a powerful technique for feature extraction from multichannel neural activity and widely used in brain computer interface (BCI) applicat...
Fikri Goksu, Nuri Firat Ince, Ahmed H. Tewfik