Sciweavers

7195 search results - page 572 / 1439
» On Computing Power
Sort
View
TPHOL
2002
IEEE
16 years 13 hour ago
Weakest Precondition for General Recursive Programs Formalized in Coq
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
CSREASAM
2007
15 years 8 months ago
Contextual Risk-Based Access Control
- Context-based access control is an emerging approach for modeling adaptive solution, making access control management more flexible and powerful. However, these strategies are in...
Nguyen Ngoc Diep, Sungyoung Lee, Young-Koo Lee, He...
FPGA
1998
ACM
176views FPGA» more  FPGA 1998»
15 years 11 months ago
A Fast Routability-Driven Router for FPGAs
Three factors are driving the demand for rapid FPGA compilation. First, as FPGAs have grown in logic capacity, the compile computation has grown more quickly than the compute powe...
Jordan S. Swartz, Vaughn Betz, Jonathan Rose
ATAL
2010
Springer
15 years 8 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
CCGRID
2004
IEEE
15 years 11 months ago
Design and implementation of an OGSI-compliant Grid broker service
Grid computing promises the ability to share geographically and organizationally distributed resources to increase effective computational power and resource utilization. However,...
Youn-Seok Kim, Jung-Lok Yu, Jae-Gyoon Hahm, Jinsoo...