10608 search results - page 299 / 2122 » Complexity of O'Hara's Algorithm |
173
click to vote
CP
1999
Springer
15 years 11 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
213
click to vote
BROADNETS
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we present a novel fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backbone...
185
click to vote
KDD
1995
ACM
15 years 10 months ago
1995
ACM
Data mining or knowledge discovery in databasesis the search for relationships and global patterns that exist but are hidden in large databases.Many different methodshave been pro...
251
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
This paper proposes a novel O(n) Parallel Banker’s Algorithm (PBA) with a best-case run-time of O(1), reduced from an ¢¤£¦¥¨§© run-time complexity of the original Ban...
161
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The next generation of advanced self-protection jammers is expected to deliver effective and energy efficient jamming against modern air tracking radars. However, optimizing such ...