Sciweavers

1578 search results - page 212 / 316
» Algorithmic randomness of continuous functions
Sort
View
HYBRID
1997
Springer
14 years 12 days ago
On-Line, Reflexive Constraint Satisfaction for Hybrid Systems: First Steps
Abstract. We can achieve guaranteed constraint satisfaction of a hybrid dynamical system (which takes into account the underlying continuous dynamics) in a simple, hierarchical con...
Michael S. Branicky
ENGL
2007
89views more  ENGL 2007»
13 years 8 months ago
Similarity-based Heterogeneous Neural Networks
This research introduces a general class of functions serving as generalized neuron models to be used in artificial neural networks. They are cast in the common framework of comp...
Lluís A. Belanche Muñoz, Julio Jose ...
MP
2008
135views more  MP 2008»
13 years 8 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
ICML
2005
IEEE
14 years 9 months ago
Combining model-based and instance-based learning for first order regression
T ORDER REGRESSION (EXTENDED ABSTRACT) Kurt Driessensa Saso Dzeroskib a Department of Computer Science, University of Waikato, Hamilton, New Zealand (kurtd@waikato.ac.nz) b Departm...
Kurt Driessens, Saso Dzeroski
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
14 years 17 days ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio