Sciweavers

3616 search results - page 174 / 724
» Conditional Memory Ordering
Sort
View
JC
2006
53views more  JC 2006»
15 years 6 months ago
The randomized information complexity of elliptic PDE
We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q Rd with smooth coefficients and homogene...
Stefan Heinrich
140
Voted
CHI
2001
ACM
16 years 6 months ago
Ignoring perfect knowledge in-the-world for imperfect knowledge in-the-head
Constraints and dependencies among the elements of embodied cognition form patterns or microstrategies of interactive behavior. Hard constraints determine which microstrategies ar...
Wayne D. Gray, Wai-Tat Fu
COGSCI
2004
81views more  COGSCI 2004»
15 years 6 months ago
Soft constraints in interactive behavior: the case of ignoring perfect knowledge in-the-world for imperfect knowledge in-the-hea
Constraints and dependencies among the elements of embodied cognition form patterns or microstrategies of interactive behavior. Hard constraints determine which microstrategies ar...
Wayne D. Gray, Wai-Tat Fu
TACAS
2007
Springer
144views Algorithms» more  TACAS 2007»
16 years 12 days ago
Detecting Races in Ensembles of Message Sequence Charts
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
Edith Elkind, Blaise Genest, Doron Peled
162
Voted
JCT
1998
99views more  JCT 1998»
15 years 6 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu