2038 search results - page 315 / 408 » Loops under Strategies |
142
click to vote
VMV
2008
15 years 5 months ago
2008
Visualizing 3D flow fields intrinsically suffers from problems of clutter and occlusion. A common practice to alleviate these issues is to restrict the visualization to feature su...
123
click to vote
SNPD
2007
15 years 5 months ago
2007
In this paper, we propose a new class of interconnection networks, called “biswapped networks” (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simp...
144
click to vote
AAAI
2006
15 years 5 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
137
Voted
AAAI
2006
15 years 5 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
115
Voted
DLT
2004
15 years 5 months ago
2004
Abstract. We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying ...