Sciweavers

11328 search results - page 2265 / 2266
» Timed Branching Processes
Sort
View
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 11 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
GECCO
1999
Springer
111views Optimization» more  GECCO 1999»
14 years 3 months ago
Evolving a behavior-based control architecture- From simulations to the real world
Genetic programming makes it possible to automatically search the space of possible programs. First we evolved a behavior-based control architecture using computer simulations. Th...
Marc Ebner, Andreas Zell
AAAI
2008
14 years 1 months ago
RADAR: A Personal Assistant that Learns to Reduce Email Overload
Email client software is widely used for personal task management, a purpose for which it was not designed and is poorly suited. Past attempts to remedy the problem have focused o...
Michael Freed, Jaime G. Carbonell, Geoffrey J. Gor...
AIIDE
2008
14 years 1 months ago
Dynamic Expansion of Behaviour Trees
Artificial intelligence in games is typically used for creating player's opponents. Manual edition of intelligent behaviors for Non-Player Characters (NPCs) of games is a cum...
Gonzalo Flórez Puga, Marco Antonio Gó...
BMCBI
2008
129views more  BMCBI 2008»
13 years 11 months ago
Motif-directed network component analysis for regulatory network inference
Background: Network Component Analysis (NCA) has shown its effectiveness in discovering regulators and inferring transcription factor activities (TFAs) when both microarray data a...
Chen Wang, Jianhua Xuan, Li Chen, Po Zhao, Yue Wan...
« Prev « First page 2265 / 2266 Last » Next »