1445 search results - page 64 / 289 » Uniformly Hard Languages |
CP
2005
Springer
14 years 3 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
ECBS
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper we argue for UML-based metamodeling and pattern-based graph transformation techniques in computer-based systems development through an illustrative example from the ...
IWPC
2006
IEEE
14 years 4 months ago
2006
IEEE
Object-oriented legacy systems are hard to maintain because they are hard to understand. One of the main understanding problems is revealed by the so-called ”yo-yo effect” tha...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
ESORICS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...