246 search results - page 31 / 50 » Dynamic Local Search for the Maximum Clique Problem |
IJON
2007
14 years 9 months ago
2007
The blind source separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical independence between outputs. Since global maximization may...
106
click to vote
SIGMOD
2012
ACM
13 years 2 days ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
90
Voted
ECMDAFA
2010
Springer
15 years 29 days ago
2010
Springer
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...
94
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—Intelligent transportation systems have become increasingly important for the public transportation in Shanghai. In response, ShanghaiGrid (SG) aims to provide abundant intellig...