4539 search results - page 227 / 908 » Approaches to Compute Workflow Complexity |
161
click to vote
AAAI
1993
15 years 6 months ago
1993
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
144
click to vote
PR
2007
15 years 5 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
134
click to vote
CEC
2010
IEEE
2010
IEEE
A binary Particle Swarm Optimization approach to fault diagnosis in parallel and distributed systems
15 years 4 months ago
— The efficient diagnosis of hardware and software faults in parallel and distributed systems remains a challenge in today’s most prolific decentralized environments. System-...
135
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weig...
141
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...