1927 search results - page 108 / 386 » UMDAs for dynamic optimization problems |
117
Voted
PLDI
2011
ACM
14 years 3 months ago
2011
ACM
In writing parallel programs, programmers expose parallelism and optimize it to meet a particular performance goal on a single platform under an assumed set of workload characteri...
79
Voted
ANOR
2010
15 years 26 days ago
2010
Abstract In the controlled ovary hyperstimulation (COH) cycle of the in vitro fertilization-embryo transfer (IVFET) therapy, the clinicians observe the patients' responses to ...
186
Voted
PODS
2009
ACM
16 years 1 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
106
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
112
Voted
ISPA
2004
Springer
15 years 6 months ago
2004
Springer
The dynamic changes of the topology caused by the movement of nodes makes routing become one of the key problems in the mobile Ad Hoc Networks (MANET). So how to optimize routing b...