2236 search results - page 296 / 448 » Language Independence and Language Tolerance in Logic Progra... |
141
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
105
click to vote
IFIP
1999
Springer
15 years 8 months ago
1999
Springer
: This paper presents a synthesis algorithm for pipelined circuits. The circuit is specified as a collection of independent, looselycoupled modules connected by queues. The synthe...
122
click to vote
IFIP
1997
Springer
15 years 8 months ago
1997
Springer
This paper provides a conservative estimation of the required bandwidth for video sources multiplexed according to the bu erless scheme and using the Statistical Bit Rate transfer...
113
Voted
ICALP
1993
Springer
15 years 8 months ago
1993
Springer
Broadcasting concerns transmitting information from a node of a communication network to all other nodes. We consider this problem assuming that links and nodes of the network fail...
147
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...