Sciweavers

837 search results - page 73 / 168
» Hard combinators
Sort
View
ECOOP
1999
Springer
15 years 4 months ago
Dynamic Query-Based Debugging
Program errors are hard to find because of the cause-effect gap between the time when an error occurs and the time when the error becomes apparent to the programmer. Although debu...
Raimondas Lencevicius, Urs Hölzle, Ambuj K. S...
KI
1999
Springer
15 years 4 months ago
Systematic vs. Local Search for SAT
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
Holger H. Hoos, Thomas Stützle
CEC
2007
IEEE
15 years 3 months ago
A hybrid evolutionary approach to the university course timetabling problem
Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...
Salwani Abdullah, Edmund K. Burke, Barry McCollum
EUROPAR
2007
Springer
15 years 3 months ago
Efficient Parallel Simulation of Large-Scale Neuronal Networks on Clusters of Multiprocessor Computers
To understand the principles of information processing in the brain, we depend on models with more than 105 neurons and 109 connections. These networks can be described as graphs o...
Hans E. Plesser, Jochen M. Eppler, Abigail Morriso...
CCS
2006
ACM
15 years 3 months ago
Bridging the gap between web application firewalls and web applications
Web applications are the Achilles heel of our current ICT infrastructure. NIST's national vulnerability database clearly shows that the percentage of vulnerabilities located ...
Lieven Desmet, Frank Piessens, Wouter Joosen, Pier...