845 search results - page 144 / 169 » Connecting Many-Sorted Theories |
COGSCI
2002
13 years 8 months ago
2002
Four experiments examined the strategies that individuals develop in sentential reasoning. They led to the discovery of five different strategies. According to the theory proposed...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
MOBICOM
2006
ACM
14 years 2 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...