11328 search results - page 1856 / 2266 » Timed Branching Processes |
170
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
147
click to vote
DAWAK
2008
Springer
15 years 6 months ago
2008
Springer
The DWS (Data Warehouse Striping) technique is a data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables are distribute...
191
Voted
DCOSS
2008
Springer
15 years 6 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
167
Voted
DIALM
2008
ACM
15 years 6 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
172
click to vote
DIS
2008
Springer
15 years 6 months ago
2008
Springer
We propose a well-founded method of ranking a pool of m trained classifiers by their suitability for the current input of n instances. It can be used when dynamically selecting a s...