1686 search results - page 115 / 338 » Programs as polygraphs: computability and complexity |
137
click to vote
ICLP
2001
Springer
15 years 8 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
109
Voted
SODA
2010
ACM
15 years 1 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
109
click to vote
AGP
2003
IEEE
15 years 8 months ago
2003
IEEE
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
135
click to vote
CHI
1998
ACM
15 years 7 months ago
1998
ACM
Designers and researchers of human-computer interaction need tools that permit the rapid exploration and management of hypotheses about complex interactions of designs, task condi...
114
click to vote
ICNS
2008
IEEE
15 years 10 months ago
2008
IEEE
The programmable network approach allows processing of passing user data in a network, which is highly suitable especially for multimedia streams processing. However, programming ...