3637 search results - page 374 / 728 » On Dynamic Bit-Probe Complexity |
161
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
178
click to vote
IWSM
2000
Springer
15 years 10 months ago
2000
Springer
: In this article we present a method for estimating the effort of software projects following an evolutionary, object-oriented development paradigm. Effort calculation is based on...
176
click to vote
IESA
2007
15 years 8 months ago
2007
Conventional approaches to manage and control security seem to have reached their limits in new complex environments. These environments are open, dynamic, heterogeneous, distribut...
161
click to vote
AAAI
2010
15 years 8 months ago
2010
Modern complex games and simulations pose many challenges for an intelligent agent, including partial observability, continuous time and effects, hostile opponents, and exogenous ...
210
click to vote
ACE
2003
15 years 8 months ago
2003
Virtual teaming involving online presentations and peer reviews support the notion of collaborative student learning, whilst preparing them for the virtual work environment. Howev...