21324 search results - page 3795 / 4265 » Making the case for computing |
177
click to vote
ECOOPW
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. The unrelenting pace of change that confronts contemporary software developers compels them to make their applications more configurable, flexible, and adaptable. A way t...
277
Voted
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
15 years 9 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...
170
Voted
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
139
Voted
SIGCOMM
1999
ACM
15 years 9 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
144
Voted
SIGGRAPH
1999
ACM
15 years 9 months ago
1999
ACM
A multi-color dithering algorithm is proposed, which converts a barycentric combination of color intensities into a multi-color nonoverlapping surface coverage. Multi-color dither...