4714 search results - page 341 / 943 » The Complexity of Iterated Multiplication |
175
click to vote
TAICPART
2006
IEEE
16 years 22 days ago
2006
IEEE
The design of complex systems, e.g., telecom services, is nowadays usually based on the integration of components (COTS), loosely coupled in distributed architectures. When compon...
179
click to vote
SMA
2006
ACM
16 years 20 days ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
156
Voted
CP
2005
Springer
16 years 7 days ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
159
click to vote
E4MAS
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. While agents and environments are two intimately connected concepts, most approaches for multi-agent development focus on the agent-specific part of the system, whereas ...
148
click to vote
DATE
2003
IEEE
16 years 13 hour ago
2003
IEEE
While fast timing analysis methods, such as asymptotic waveform evaluation (AWE), have been well established for linear circuits, the timing analysis for non-linear circuits, whic...