1963 search results - page 123 / 393 » Applications of Preferences using Answer Set Programming |
153
Voted
MICRO
2009
IEEE
15 years 10 months ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
129
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
135
click to vote
ICSOC
2010
Springer
15 years 1 months ago
2010
Springer
A request to a service registry must be answered with a service that fits in several regards, including semantic compatibility, non-functional compatibility, and interface compati...
153
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
132
click to vote
SIGMETRICS
2010
ACM
15 years 8 months ago
2010
ACM
Perhaps surprisingly, no practical performance models exist for popular (and complex) client applications such as Adobe’s Creative Suite, Microsoft’s Office and Visual Studio...