2485 search results - page 88 / 497 » Time Bounded Frequency Computations |
146
click to vote
COCO
2007
Springer
15 years 8 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
133
click to vote
EUROPAR
2001
Springer
15 years 9 months ago
2001
Springer
This paper is on the construction of a server subsystem in a client/server system in an application context where the number of potential clients can be arbitrarily large. The imp...
147
click to vote
RTCSA
2009
IEEE
15 years 11 months ago
2009
IEEE
Soft real-time sporadic multiprocessor task systems are considered that include processing pipelines. Conditions are presented for guaranteeing bounded deadline tardiness in such ...
133
Voted
ML
2002
ACM
15 years 4 months ago
2002
ACM
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
134
Voted
WG
1998
Springer
15 years 8 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...