Sciweavers

110 search results - page 9 / 22
» Solving a Practical Examination Timetabling Problem: A Case ...
Sort
View
WWW
2005
ACM
14 years 8 months ago
Mapping XML instances
For XML-based applications in general and B2B applications in particular, mapping between differently structured XML documents, to enable exchange of data, is a basic problem. A g...
Sai Anand, Erik Wilde
QSIC
2007
IEEE
14 years 2 months ago
Model Checking Security Pattern Compositions
Security patterns capture best practice on secure software design and development. They document typical solutions to security problems. To ensure security, large software system ...
Jing Dong, Tu Peng, Yajing Zhao
AOSD
2007
ACM
13 years 11 months ago
Aspect-oriented application-level scheduling for J2EE servers
Achieving sufficient execution performance is a challenging goal of software development. Unfortunately, violating performance requirements is often revealed at a late stage of th...
Kenichi Kourai, Hideaki Hibino, Shigeru Chiba
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
13 years 9 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
AI
2003
Springer
14 years 28 days ago
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
Dave A. D. Tompkins, Holger H. Hoos