380 search results - page 73 / 76 » A Categorical Setting for Lower Complexity |
104
click to vote
EMSOFT
2004
Springer
15 years 3 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
ICDT
2010
ACM
15 years 2 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
127
Voted
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
167
click to vote
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
15 years 1 months ago
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...