1456 search results - page 36 / 292 » Improved Randomized Results for That Interval Selection Prob... |
125
click to vote
TAINN
2005
Springer
15 years 3 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
LCN
1997
IEEE
15 years 2 months ago
1997
IEEE
W e investigate packet discarding schemes for TCP over ATM with UBR service. In doing so, we tested the eflective throughput of two existing schemes, Partial Pnwlcet Discard(PPD) ...
ISSTA
2006
ACM
15 years 4 months ago
2006
ACM
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
APNOMS
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP p...
IDA
2002
Springer
14 years 9 months ago
2002
Springer
The ability to identify the mineral composition of rocks and soils is an important tool for the exploration of geological sites. Even though expert knowledge is commonly used for t...