400 search results - page 33 / 80 » Hard Problem Generation for MKP |
85
Voted
DAC
1999
ACM
16 years 1 months ago
1999
ACM
In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers,...
133
Voted
ICSOC
2007
Springer
15 years 6 months ago
2007
Springer
Ontologies will be crucial for the future development of Next Generation Service Delivery Platforms. While various projects have defined ontologies for the mobile domain, there is ...
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
103
click to vote
FM
2008
Springer
15 years 2 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
87
Voted
DAGSTUHL
2007
15 years 2 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...