Sciweavers

6167 search results - page 20 / 1234
» Can Refinement be Automated
Sort
View
HCI
2009
13 years 7 months ago
The Evolution of a Web Accessibility Testing Protocol
In early 2007, the California State University (CSU) system initiated a program to make all information technology accessible to persons with disabilities; the authors were appoint...
Tom Jewett, Wayne Dick
TCAD
2010
121views more  TCAD 2010»
13 years 4 months ago
Translation Validation of High-Level Synthesis
The growing complexity of systems and their implementation into silicon encourages designers to look for model designs at higher levels of abstraction and then incrementally build ...
Sudipta Kundu, Sorin Lerner, Rajesh K. Gupta
KR
1998
Springer
14 years 2 months ago
What Robots Can Do
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot,...
Hector J. Levesque
ECSQARU
2009
Springer
13 years 7 months ago
Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?
Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
Sébastien Destercke, Didier Dubois
FMCAD
2007
Springer
14 years 1 months ago
Transaction Based Modeling and Verification of Hardware Protocols
Modeling hardware through atomic guard/action transitions with interleaving semantics is popular, owing to the conceptual clarity of modeling and verifying the high level behavior ...
Xiaofang Chen, Steven M. German, Ganesh Gopalakris...