13603 search results - page 139 / 2721 » On the Computational Complexity of Cut-Reduction |
151
Voted
UC
2005
Springer
15 years 11 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...
268
Voted
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
183
click to vote
TARK
2009
Springer
16 years 21 days ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
156
click to vote
ICTAI
2008
IEEE
16 years 17 days ago
2008
IEEE
The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach t...
163
Voted
ALGOSENSORS
2004
Springer
15 years 11 months ago
2004
Springer
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...