Sciweavers

9730 search results - page 1924 / 1946
» Relating models of backtracking
Sort
View
ALGORITHMICA
1999
156views more  ALGORITHMICA 1999»
14 years 9 months ago
Competitive Optimal On-Line Leasing
Consider an on-line player who needs some equipment (e.g., a computer) for an initially unknown number of periods. At the start of each period it is determined whether the player w...
Ran El-Yaniv, R. Kaniel, Nathan Linial
IJRR
2002
143views more  IJRR 2002»
14 years 9 months ago
Persistent Passive Hopping and Juggling is Possible Even With Plastic Collisions
We describe simple one-dimensional models of passive (no energy input, no control), generally dissipative, vertical hopping and oneball juggling. The central observation is that i...
Anindya Chatterjee, R. Pratap, C. K. Reddy, Andy R...
CJTCS
1999
133views more  CJTCS 1999»
14 years 9 months ago
The Permanent Requires Large Uniform Threshold Circuits
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender
JBCS
2002
116views more  JBCS 2002»
14 years 9 months ago
Software Components Retrieval Through Mediators and Web Search
Component Based Development (CBD) aims at constructing software through the integration, using interfaces and contracts, between pre-existing components. The main goal of this wor...
Robson P. de Souza, Marcelo N. Costa, Regina M. M....
JCB
2002
70views more  JCB 2002»
14 years 9 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...
« Prev « First page 1924 / 1946 Last » Next »