Sciweavers

149 search results - page 28 / 30
» Dynamic Maps as Representations of Verbs
Sort
View
COMPGEOM
2006
ACM
13 years 11 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir
ATAL
2005
Springer
13 years 11 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
EMSOFT
2008
Springer
13 years 7 months ago
A generalized static data flow clustering algorithm for mpsoc scheduling of multimedia applications
In this paper, we propose a generalized clustering approach for static data flow subgraphs mapped onto individual processors in Multi-Processor System on Chips (MPSoCs). The goal ...
Joachim Falk, Joachim Keinert, Christian Haubelt, ...
SDM
2004
SIAM
211views Data Mining» more  SDM 2004»
13 years 7 months ago
Using Support Vector Machines for Classifying Large Sets of Multi-Represented Objects
Databases are a key technology for molecular biology which is a very data intensive discipline. Since molecular biological databases are rather heterogeneous, unification and data...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
ECMDAFA
2010
Springer
228views Hardware» more  ECMDAFA 2010»
13 years 9 months ago
Example-Based Sequence Diagrams to Colored Petri Nets Transformation Using Heuristic Search
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...
Marouane Kessentini, Arbi Bouchoucha, Houari A. Sa...