777 search results - page 99 / 156 » A fast algorithm for the computation of an upper bound on th... |
CP
2007
Springer
14 years 19 days ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
CSFW
2010
IEEE
14 years 18 days ago
2010
IEEE
Abstract—Many computer systems have a functional requirement to release information. Such requirements are an important part of a system’s information security requirements. Cu...
IMC
2010
ACM
13 years 6 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
ICLP
1997
Springer
14 years 25 days ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
WAOA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...