Sciweavers

2746 search results - page 512 / 550
» Bisubmodular Function Minimization
Sort
View
DAM
1998
88views more  DAM 1998»
13 years 8 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
DATAMINE
1998
145views more  DATAMINE 1998»
13 years 8 months ago
A Tutorial on Support Vector Machines for Pattern Recognition
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...
Christopher J. C. Burges
JETAI
2002
69views more  JETAI 2002»
13 years 8 months ago
The interaction of representations and planning objectives for decision-theoretic planning tasks
We study decision-theoretic planning or reinforcement learning in the presence of traps such as steep slopes for outdoor robots or staircases for indoor robots. In this case, achi...
Sven Koenig, Yaxin Liu
TCAD
1998
125views more  TCAD 1998»
13 years 8 months ago
BDD-based synthesis of extended burst-mode controllers
Abstract—We examine the implications of a new hazard-free combinational logic synthesis method [1], which generates multiplexor-based networks from binary decision diagrams (BDDs...
Kenneth Y. Yun, Bill Lin, David L. Dill, Srinivas ...
SIAMJO
2002
117views more  SIAMJO 2002»
13 years 8 months ago
Analysis of Generalized Pattern Searches
This paper contains a new convergence analysis for the Lewis and Torczon generalized pattern search (GPS) class of methods for unconstrained and linearly constrained optimization. ...
Charles Audet, J. E. Dennis Jr.