Sciweavers

245 search results - page 24 / 49
» State Complexity of Testing Divisibility
Sort
View
108
Voted
DAC
1999
ACM
15 years 6 months ago
Stand-by Power Minimization Through Simultaneous Threshold Voltage Selection and Circuit Sizing
We present a new approach for estimation and optimization of the average stand-by power dissipation in large MOS digital circuits. To overcome the complexity of state dependence i...
Supamas Sirichotiyakul, Tim Edwards, Chanhee Oh, J...
158
Voted
IJRR
2010
162views more  IJRR 2010»
15 years 1 months ago
Planning under Uncertainty for Robotic Tasks with Mixed Observability
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
Sylvie C. W. Ong, Shao Wei Png, David Hsu, Wee Sun...
KBSE
2005
IEEE
15 years 8 months ago
Automated replay and failure detection for web applications
User-session-based testing of web applications gathers user sessions to create and continually update test suites based on real user input in the field. To support this approach ...
Sara Sprenkle, Emily Gibson, Sreedevi Sampath, Lor...
115
Voted
CIMCA
2008
IEEE
15 years 9 months ago
Connector-Driven Gradual and Dynamic Software Assembly Evolution
Complex and long-lived software need to be upgraded at runtime. Replacing a software component with a newer version is the basic evolution operation that has to be supported. It i...
Huaxi (Yulin) Zhang, Christelle Urtado, Sylvain Va...
EWRL
2008
15 years 4 months ago
Efficient Reinforcement Learning in Parameterized Models: Discrete Parameter Case
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
Kirill Dyagilev, Shie Mannor, Nahum Shimkin