1743 search results - page 92 / 349 » Generalized Modal Satisfiability |
106
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
69
Voted
IEAAIE
2004
Springer
15 years 6 months ago
2004
Springer
This paper proposes extending semi-supervised learning by allowing an ongoing interaction between a user and the system. The extension is intended to not only to speed up search fo...
96
Voted
ADHOCNOW
2003
Springer
15 years 6 months ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
108
Voted
SIGSOFT
1994
ACM
15 years 4 months ago
1994
ACM
A dependence model for reverse engineering should treat procedures in a modular fashion and should be fine-grained, distinguishing dependences that are due to different variables....
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...