Sciweavers

3446 search results - page 198 / 690
» A Reasoning Algorithm for pD*
Sort
View
FORMATS
2006
Springer
15 years 8 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 6 months ago
Learning Random Monotone DNF
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedi...
IJCAI
2003
15 years 5 months ago
Probabilistically Survivable MASs
Muhiagent systems (MAS) can "go down" for a large number of reasons, ranging from system malfunctions and power failures to malicious attacks. The placement of agents on...
Sarit Kraus, V. S. Subrahmanian, N. Cihan Tas
JCP
2008
133views more  JCP 2008»
15 years 4 months ago
DDSC : A Density Differentiated Spatial Clustering Technique
Finding clusters with widely differing sizes, shapes and densities in presence of noise and outliers is a challenging job. The DBSCAN is a versatile clustering algorithm that can f...
Bhogeswar Borah, Dhruba K. Bhattacharyya
IPL
2006
97views more  IPL 2006»
15 years 4 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier