Sciweavers

15485 search results - page 202 / 3097
» Computing Optimal Subsets
Sort
View
RTCSA
1999
IEEE
15 years 10 months ago
Incorporating Error Recovery into the Imprecise Computation Model
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...
Hakan Aydin, Rami G. Melhem, Daniel Mossé
FUIN
2006
106views more  FUIN 2006»
15 years 6 months ago
Architectural Principles and Scheduling Strategies for Computing Agent Systems
The paper introduces the formal description of a computing multi-agent system (MAS), its architecture and dynamics (sections 2
Marek Grochowski, Robert Schaefer, Maciej Smolka
ICML
2008
IEEE
16 years 7 months ago
Stopping conditions for exact computation of leave-one-out error in support vector machines
We propose a new stopping condition for a Support Vector Machine (SVM) solver which precisely reflects the objective of the Leave-OneOut error computation. The stopping condition ...
Klaus-Robert Müller, Pavel Laskov, Vojtech Fr...
TON
2002
138views more  TON 2002»
15 years 6 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
CPM
2004
Springer
145views Combinatorics» more  CPM 2004»
15 years 11 months ago
Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs
The perfect phylogeny model for haplotype evolution has been successfully applied to haplotype resolution from genotype data. In this study we explore the application of the perfe...
Tamar Barzuza, Jacques S. Beckmann, Ron Shamir, It...