Sciweavers

613 search results - page 69 / 123
» Some Observations on Holographic Algorithms
Sort
View
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
12 years 11 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
IMC
2003
ACM
14 years 1 months ago
Simple network performance tomography
In network performance tomography, characteristics of the network interior are inferred by correlating end-to-end measurements. In much previous work, the presence of correlations...
Nick G. Duffield
SIGMETRICS
1998
ACM
13 years 7 months ago
Scheduling with Implicit Information in Distributed Systems
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
Andrea C. Arpaci-Dusseau, David E. Culler, Alan M....
JMLR
2010
124views more  JMLR 2010»
13 years 2 months ago
Multiclass-Multilabel Classification with More Classes than Examples
We discuss multiclass-multilabel classification problems in which the set of classes is extremely large. Most existing multiclass-multilabel learning algorithms expect to observe ...
Ofer Dekel, Ohad Shamir
IJAR
2008
83views more  IJAR 2008»
13 years 8 months ago
Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be power...
Alessandro Antonucci, Marco Zaffalon