Sciweavers

10575 search results - page 1931 / 2115
» Programming Languages
Sort
View
66
Voted
CP
2005
Springer
15 years 3 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
97
Voted
CP
2005
Springer
15 years 3 months ago
Solving Simple Planning Problems with More Inference and No Search
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
Vincent Vidal, Hector Geffner
72
Voted
EMSOFT
2005
Springer
15 years 3 months ago
Using de-optimization to re-optimize code
The nature of embedded systems development places a great deal of importance on meeting strict requirements in areas such as static code size, power consumption, and execution tim...
Stephen Hines, Prasad Kulkarni, David B. Whalley, ...
99
Voted
GPCE
2005
Springer
15 years 3 months ago
Object-Oriented Reengineering Patterns - An Overview
Successful software systems must be prepared to evolve or they will die. Although object-oriented software systems are built to last, over time they degrade as much as any legacy s...
Oscar Nierstrasz, Stéphane Ducasse, Serge D...
86
Voted
ICALP
2005
Springer
15 years 3 months ago
Password-Based Encryption Analyzed
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
Martín Abadi, Bogdan Warinschi
« Prev « First page 1931 / 2115 Last » Next »