1941 search results - page 203 / 389 » On the Hardness of Approximate Reasoning |
169
click to vote
WABI
2007
Springer
16 years 17 days ago
2007
Springer
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...
172
click to vote
WIDM
2006
ACM
16 years 12 days ago
2006
ACM
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
142
click to vote
IWPC
2005
IEEE
16 years 1 days ago
2005
IEEE
Approximately 70% of the source code of a software system consists of identifiers. Hence, the names chosen as identifiers are of paramount importance for the readability of comp...
191
click to vote
WIOPT
2005
IEEE
16 years 1 days ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
162
click to vote
UC
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...