Sciweavers

1289 search results - page 255 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
JALC
2007
90views more  JALC 2007»
14 years 9 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
JCP
2007
143views more  JCP 2007»
14 years 9 months ago
Alternatives for In-Service BER Estimation in All-Optical Networks: Towards Minimum Intrusion
— Combining the existing approaches for optical intelligence and the speed and capacity of light is undoubtedly the only viable strategy for building future-proof, highspeed netw...
Carolina Pinart
TON
2008
119views more  TON 2008»
14 years 9 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
CORR
2004
Springer
180views Education» more  CORR 2004»
14 years 9 months ago
Self-Organized Stigmergic Document Maps: Environment as a Mechanism for Context Learning
Social insect societies and more specifically ant colonies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organi...
Vitorino Ramos, Juan J. Merelo Guervós
FSS
2002
84views more  FSS 2002»
14 years 9 months ago
A possibilistic approach to selecting portfolios with highest utility score
The mean-variance methodology for the portfolio selection problem, originally proposed by Markowitz, has been one of the most important research fields in modern finance. In this ...
Christer Carlsson, Robert Fullér, Pé...