Sciweavers

879 search results - page 9 / 176
» Kolmogorov Complexity and Model Selection
Sort
View
ALT
1997
Springer
13 years 11 months ago
Learning DFA from Simple Examples
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
Rajesh Parekh, Vasant Honavar
NETWORK
2007
93views more  NETWORK 2007»
13 years 7 months ago
Modeling VoIP Call Holding Times for Telecommunications
Voice over IP is one of the most popular applications in broadband access networks. It is anticipated that the characteristics of call holding times (CHTs) for VoIP calls will be ...
Whai-En Chen, Hui-Nien Hung, Yi-Bing Lin
CEC
2008
IEEE
14 years 2 months ago
Automatic model type selection with heterogeneous evolution: An application to RF circuit block modeling
— Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a cost effe...
Dirk Gorissen, Luciano De Tommasi, Jeroen Croon, T...
SMA
1997
ACM
120views Solid Modeling» more  SMA 1997»
13 years 11 months ago
The Generic Geometric Complex (GGC): A Modeling Scheme for Families of Decomposed Pointsets
: Modeling of families of geometric objects is a major topic in modern geometric and solid modeling. Object families are central to many important solid modeling applications, incl...
Ari Rappoport
SYNTHESE
2008
84views more  SYNTHESE 2008»
13 years 7 months ago
Model structure adequacy analysis: selecting models on the basis of their ability to answer scientific questions
Models carry the meaning of science. This puts a tremendous burden on the process of model selection. In general practice, models are selected on the basis of their relative goodne...
Mark L. Taper, David F. Staples, Bradley B. Shepar...