Sciweavers

1007 search results - page 52 / 202
» The Complexity of Futile Questioning
Sort
View
LICS
2008
IEEE
15 years 10 months ago
The Quest for a Logic Capturing PTIME
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
Martin Grohe
DEXAW
2005
IEEE
116views Database» more  DEXAW 2005»
15 years 9 months ago
Towards Self-Predicting Systems: What If You Could Ask "What-If"?
Today, management and tuning questions are approached using if...then... rules of thumb. This reactive approach requires expertise regarding of system behavior, making it difficu...
Eno Thereska, Dushyanth Narayanan, Gregory R. Gang...
AAAI
2006
15 years 5 months ago
Factored Planning: How, When, and When Not
Automated domain factoring, and planning methods that utilize them, have long been of interest to planning researchers. Recent work in this area yielded new theoretical insight an...
Ronen I. Brafman, Carmel Domshlak
MOBISYS
2011
ACM
14 years 6 months ago
Odessa: enabling interactive perception applications on mobile devices
Resource constrained mobile devices need to leverage computation on nearby servers to run responsive applications that recognize objects, people, or gestures from real-time video....
Moo-Ryong Ra, Anmol Sheth, Lily B. Mummert, Padman...
STACS
2012
Springer
13 years 11 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen