Sciweavers

10458 search results - page 440 / 2092
» Modeling Features at Runtime
Sort
View
CEEMAS
2005
Springer
16 years 11 days ago
On Communication in Solving Distributed Constraint Satisfaction Problems
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...
Hyuckchul Jung, Milind Tambe
PKDD
2005
Springer
95views Data Mining» more  PKDD 2005»
16 years 9 days ago
Ensembles of Balanced Nested Dichotomies for Multi-class Problems
Abstract. A system of nested dichotomies is a hierarchical decomposition of a multi-class problem with c classes into c − 1 two-class problems and can be represented as a tree st...
Lin Dong, Eibe Frank, Stefan Kramer
IPSN
2004
Springer
16 years 6 days ago
Constraint-guided dynamic reconfiguration in sensor networks
This paper presents an approach for dynamic software reconfiguration in sensor networks. Our approach utilizes explicit models of the design space of the embedded application. The...
Sachin Kogekar, Sandeep Neema, Brandon Eames, Xeno...
213
Voted
APSCC
2009
IEEE
15 years 12 months ago
Extended policies for automatic service composition in IMS
— Service creation by composing existing services and/or network resources is considered by Telecom and Internet industries as the trend for service provisioning in Next Generati...
Cuiting Huang, Noël Crespi
PAKDD
2010
ACM
212views Data Mining» more  PAKDD 2010»
15 years 11 months ago
Fast Perceptron Decision Tree Learning from Evolving Data Streams
Abstract. Mining of data streams must balance three evaluation dimensions: accuracy, time and memory. Excellent accuracy on data streams has been obtained with Naive Bayes Hoeffdi...
Albert Bifet, Geoffrey Holmes, Bernhard Pfahringer...