2693 search results - page 475 / 539 » On Computing Complex Navigation Functions |
161
click to vote
ICFP
2008
ACM
16 years 5 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
153
click to vote
SAC
2010
ACM
15 years 12 months ago
2010
ACM
Cluster-based multi-tier systems provide a means for building scalable Internet services. Building adaptive Internet services that are able to apply appropriate system sizing and ...
129
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
160
Voted
NOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— The behaviour of systems on chip (SOC) is complex because they contain multiple processors that interact through concurrent interconnects, such as networks on chip (NOC...
165
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...