Sciweavers

2006 search results - page 383 / 402
» MUC-5 evaluation metrics
Sort
View
DSS
2007
89views more  DSS 2007»
13 years 7 months ago
Scheduling meetings through multi-agent negotiations
This work presents a set of protocols for scheduling a meeting among agents that represent their respective user's interests. Four protocols are discussed: a) the full inform...
Jacques Wainer, Paulo Roberto Ferreira Jr., Everto...
JSAC
2006
115views more  JSAC 2006»
13 years 7 months ago
Deployment of an Algorithm for Large-Scale Topology Discovery
Abstract-- Topology discovery systems are starting to be introduced in the form of easily and widely deployed software. Unfortunately, the research community has not examined the p...
Benoit Donnet, Philippe Raoult, Timur Friedman, Ma...
ET
2007
89views more  ET 2007»
13 years 7 months ago
QCA Circuits for Robust Coplanar Crossing
In this paper, different circuits of Quantum-dot Cellular Automata (QCA) are proposed for the so-called coplanar crossing. Coplanar crossing is one of the most interesting feature...
Sanjukta Bhanja, Marco Ottavi, Fabrizio Lombardi, ...
FGCS
2007
99views more  FGCS 2007»
13 years 7 months ago
Mining performance data for metascheduling decision support in the Grid
: Metaschedulers in the Grid needs dynamic information to support their scheduling decisions. Job response time on computing resources, for instance, is such a performance metric. ...
Hui Li, David L. Groep, Lex Wolters
ML
2006
ACM
142views Machine Learning» more  ML 2006»
13 years 7 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....