Sciweavers

28888 search results - page 5590 / 5778
» Computability and complexity in analysis
Sort
View
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 7 months ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng
172
Voted
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 7 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
195
Voted
AII
1992
15 years 7 months ago
Learning from Multiple Sources of Inaccurate Data
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...
Ganesh Baliga, Sanjay Jain, Arun Sharma
128
Voted
ISER
1993
Springer
141views Robotics» more  ISER 1993»
15 years 7 months ago
Experimental Integration of Planning in a Distributed Control System
This paper describes a complete system architecture integrating planning into a two-armed robotic workcell. The system is comprised of four major components: user interface, plann...
Gerardo Pardo-Castellote, Tsai-Yen Li, Yoshihito K...
174
Voted
POPL
1989
ACM
15 years 7 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
« Prev « First page 5590 / 5778 Last » Next »