Sciweavers

11051 search results - page 218 / 2211
» An Investigation of Generalized Cases
Sort
View
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
15 years 11 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
FOCS
1997
IEEE
15 years 10 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 10 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
AAAI
2006
15 years 8 months ago
Preference Elicitation and Generalized Additive Utility
Any automated decision support software must tailor its actions or recommendations to the preferences of different users. Thus it requires some representation of user preferences ...
Darius Braziunas, Craig Boutilier
AMC
2006
67views more  AMC 2006»
15 years 6 months ago
A general probabilistic model of the PCR process
Earlier work by Saha et al. rigorously derived a general probabilistic model for the PCR process that includes as a special case the Velikanov-Kapral model where all nucleotide re...
Nilanjan Saha, Layne T. Watson, Karen Kafadar, Ale...