2485 search results - page 203 / 497 » Time Bounded Frequency Computations |
167
click to vote
FCT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...
171
click to vote
DLT
2010
15 years 8 months ago
2010
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...
168
click to vote
ICRA
2006
IEEE
16 years 17 days ago
2006
IEEE
- Collision detection is a critical module in many applications such as computer graphics, robot motion planning, physical simulation, CAD/CAM, and molecular modeling. Many efficie...
215
click to vote
RTSS
2003
IEEE
15 years 11 months ago
2003
IEEE
Data caches are essential in modern processors, bridging the widening gap between main memory and processor speeds. However, they yield very complex performance models, which make...
215
click to vote
RTCSA
1998
IEEE
15 years 10 months ago
1998
IEEE
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...