3616 search results - page 355 / 724 » Conditional Memory Ordering |
127
click to vote
AAAI
2007
15 years 6 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
140
click to vote
ICONIP
2008
15 years 5 months ago
2008
Several applications would emerge from the development of efficient and robust sound classification systems able to identify the nature of non-speech sound sources. This paper prop...
132
click to vote
MASCOTS
2000
15 years 5 months ago
2000
The memory resources required by network simulations can grow quadratically with size of the simulated network. In simulations that use routing tables at each node to perform perh...
122
click to vote
IJCAI
1997
15 years 5 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
148
click to vote
OSDI
1994
ACM
15 years 5 months ago
1994
ACM
We describe the lockingarchitecture of a new operating system, HURRICANE, designed for large scale shared-memory multiprocessors. Many papers already describe kernel lockingtechni...