5180 search results - page 294 / 1036 » Concurrency, Time, and Constraints |
260
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Relational DBMS typically execute concurrent queries independently by invoking a set of operator instances for each query. To exploit common data retrievals and computation in con...
188
click to vote
TWC
2008
15 years 6 months ago
2008
With the capability of supporting very high data rate services in a short range, Ultra-Wideband (UWB) technology is appealing to multimedia applications in future wireless personal...
202
click to vote
TKDE
2002
15 years 6 months ago
2002
As technological advances are made in software and hardware, the feasibility of accessing information "any time, anywhere" is becoming a reality. Furthermore, the diversi...
192
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
160
click to vote
CP
2005
Springer
16 years 8 days ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...