694 search results - page 30 / 139 » Open Graphs and Computational Reasoning |
PDCAT
2007
Springer
14 years 3 months ago
2007
Springer
Ubiquitous computing environment has become more popular as a highly open, heterogeneous and service-rich domain, which makes it essential and important for end-users to build a r...
ILP
2005
Springer
14 years 2 months ago
2005
Springer
We propose a new approach to Inductive Logic Programming that systematically exploits caching and offers a number of advantages over current systems. It avoids redundant computati...
APPROX
2011
Springer
12 years 9 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
WADT
1998
Springer
14 years 19 days ago
1998
Springer
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...
FOCS
1993
IEEE
14 years 1 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...