Sciweavers

8196 search results - page 198 / 1640
» Computational Modeling and Complexity Science
Sort
View
KSEM
2009
Springer
16 years 1 months ago
An Anytime Algorithm for Computing Inconsistency Measurement
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
FOCS
2003
IEEE
15 years 11 months ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen
FOCS
1998
IEEE
15 years 10 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
GI
2010
Springer
15 years 4 months ago
Cloud Computing for Autonomous Control in Logistics
Abstract: Logistics processes in a globalised economy are increasingly complex, dynamic, and distributed. These properties pose major challenges for logistics planning and control....
Arne Schuldt, Karl Hribernik, Jan D. Gehrke, Klaus...
EXPCS
2007
15 years 10 months ago
EXACT: the experimental algorithmics computational toolkit
In this paper, we introduce EXACT, the EXperimental Algorithmics Computational Toolkit. EXACT is a software framework for describing, controlling, and analyzing computer experimen...
William E. Hart, Jonathan W. Berry, Robert T. Heap...