Sciweavers

43 search results - page 3 / 9
» Approximate dynamic programming for rail operations
Sort
View
MDM
2009
Springer
123views Communications» more  MDM 2009»
14 years 2 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
CPHYSICS
2006
103views more  CPHYSICS 2006»
13 years 7 months ago
WATERWAVES: wave particles dynamics on a complex triatomic potential
The WATERWAVES program suite performs complex scattering calculations by propagating a wave packet in a complex, full-dimensional potential for non-rotating (J = 0) but vibrating ...
Simone Taioli, Jonathan Tennyson
PLDI
2011
ACM
12 years 10 months ago
EnerJ: approximate data types for safe and general low-power computation
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
Adrian Sampson, Werner Dietl, Emily Fortuna, Danus...
LCTRTS
2000
Springer
13 years 11 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
BIBE
2005
IEEE
124views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Approximate Global Alignment of Sequences
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
Tamer Kahveci, Venkatakrishnan Ramaswamy, Han Tao,...