Sciweavers

1941 search results - page 382 / 389
» On the Hardness of Approximate Reasoning
Sort
View
INFOCOM
2000
IEEE
15 years 1 months ago
Broadcast Disks with Polynomial Cost Functions
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
ISCC
2000
IEEE
156views Communications» more  ISCC 2000»
15 years 1 months ago
Inverse Multiplexing for ATM. Technical Operation, Applications and Performance Evaluation Study
-- In a WAN established infrastructure, one of the main problems ATM network planners and users face, when greater than T1/E1 bandwidth is required, is the high cost associated to ...
Marcos Postigo-Boix, Mónica Aguilar-Igartua...
ATAL
2006
Springer
15 years 1 months ago
Continuous refinement of agent resource estimates
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
David N. Morley, Karen L. Myers, Neil Yorke-Smith
FMICS
2006
Springer
15 years 1 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
AFRIGRAPH
2003
ACM
15 years 1 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...