Sciweavers

198 search results - page 31 / 40
» Anytime Bounded Rationality
Sort
View
65
Voted
MOC
1998
65views more  MOC 1998»
14 years 9 months ago
Solving constrained Pell equations
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
Kiran S. Kedlaya
JAR
2010
160views more  JAR 2010»
14 years 8 months ago
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for ...
Behzad Akbarpour, Lawrence C. Paulson
ASPLOS
2012
ACM
13 years 5 months ago
DreamWeaver: architectural support for deep sleep
Numerous data center services exhibit low average utilization leading to poor energy efficiency. Although CPU voltage and frequency scaling historically has been an effective mea...
David Meisner, Thomas F. Wenisch
ALDT
2011
Springer
251views Algorithms» more  ALDT 2011»
13 years 9 months ago
Game Theory and Human Behavior: Challenges in Security and Sustainability
Security and sustainability are two critical global challenges that involve the interaction of many intelligent actors. Game theory provides a sound mathematical framework to model...
Rong Yang, Milind Tambe, Manish Jain, Jun-young Kw...
87
Voted
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 2 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic