14699 search results - page 288 / 2940 » Complexity and Cognitive Computing |
145
click to vote
CAD
2006
Springer
2006
Springer
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
15 years 4 months ago
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
138
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
133
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
125
click to vote
ERSHOV
2003
Springer
15 years 9 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
134
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.