1668 search results - page 164 / 334 » Two Philosophical Applications of Algorithmic Information Th... |
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
SIGECOM
2010
ACM
13 years 8 months ago
2010
ACM
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...
CIKM
2004
Springer
14 years 1 months ago
2004
Springer
Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic i...
IEEECIT
2010
IEEE
13 years 6 months ago
2010
IEEE
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
UIST
2006
ACM
14 years 2 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...