Sciweavers

4488 search results - page 554 / 898
» Properties of NP-Complete Sets
Sort
View
ENTCS
2002
77views more  ENTCS 2002»
15 years 6 months ago
Trivial Reals
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
JASIS
2000
76views more  JASIS 2000»
15 years 6 months ago
Guided paths through Web-based collections: Design, experiences, and adaptations
Digital libraries need to facilitate the use of digital information in a variety of settings. One approach to making information useful is to enable its application to situations ...
Frank M. Shipman III, Richard Furuta, Donald Brenn...
AI
1999
Springer
15 years 6 months ago
Learning by Discovering Concept Hierarchies
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
Blaz Zupan, Marko Bohanec, Janez Demsar, Ivan Brat...
AUTOMATICA
1999
119views more  AUTOMATICA 1999»
15 years 6 months ago
Robust L2-gain control for nonlinear systems with projection dynamics and input constraints: an example from traffic control
We formulate the L2-gain control problem for a general nonlinear, state-space system with projection dynamics in the state evolution and hard constraints on the set of admissible ...
Joseph A. Ball, Martin V. Day, Tungsheng Yu, Pushk...
JAL
1998
85views more  JAL 1998»
15 years 6 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay