Sciweavers

2968 search results - page 198 / 594
» Network Programming Using PLAN
Sort
View
KDD
2008
ACM
274views Data Mining» more  KDD 2008»
16 years 3 months ago
Data mining using high performance data clouds: experimental studies using sector and sphere
We describe the design and implementation of a high performance cloud that we have used to archive, analyze and mine large distributed data sets. By a cloud, we mean an infrastruc...
Robert L. Grossman, Yunhong Gu
AIPS
2010
15 years 4 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
CORR
2012
Springer
185views Education» more  CORR 2012»
13 years 11 months ago
Bayesian network learning with cutting planes
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
James Cussens
CP
2003
Springer
15 years 8 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
ACSAC
2006
IEEE
15 years 9 months ago
NetSpy: Automatic Generation of Spyware Signatures for NIDS
We present NetSpy, a tool to automatically generate network-level signatures for spyware. NetSpy determines whether an untrusted program is spyware by correlating user input with ...
Hao Wang, Somesh Jha, Vinod Ganapathy