Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
We compare standard global IR searching with user-centric localized techniques to address the database selection problem. We conduct a series of experiments to compare the retriev...
We report on an ongoing project which aims at improving the eectiveness of retrieval and accessibility of learning object within learning management systems and learning object re...
Lothar Lemnitzer, Cristina Vertan, Alex Killing, K...
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and...