Sciweavers

1763 search results - page 226 / 353
» Dependent random choice
Sort
View
AAAI
1994
13 years 9 months ago
An Algorithm for Probabilistic Least-Commitment Planning
We de ne the probabilistic planning problem in terms of a probability distribution over initial world states, a boolean combination of goal propositions, a probability threshold, ...
Nicholas Kushmerick, Steve Hanks, Daniel S. Weld
ICML
2010
IEEE
13 years 9 months ago
Learning Temporal Causal Graphs for Relational Time-Series Analysis
Learning temporal causal graph structures from multivariate time-series data reveals important dependency relationships between current observations and histories, and provides a ...
Yan Liu 0002, Alexandru Niculescu-Mizil, Aurelie C...
DAGM
2010
Springer
13 years 8 months ago
Learning of Optimal Illumination for Material Classification
We present a method to classify materials in illumination series data. An illumination series is acquired using a device which is capable to generate arbitrary lighting environment...
Markus Jehle, Christoph Sommer, Bernd Jähne
COMCOM
2010
179views more  COMCOM 2010»
13 years 8 months ago
On the statistical characterization of flows in Internet traffic with application to sampling
A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as...
Yousra Chabchoub, Christine Fricker, Fabrice Guill...
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 8 months ago
Local Information Based Algorithms for Packet Transport in Complex Networks
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
Bernard Kujawski, G. J. Rodgers, Bosiljka Tadic