41 search results - page 2 / 9 » A Language for Specifying Complete Timetabling Problems |
POPL
2006
ACM
14 years 5 months ago
2006
ACM
C++ templates are key to the design of current successful mainstream libraries and systems. They are the basis of programming techniques in diverse areas ranging from conventional...
WWW
2004
ACM
14 years 6 months ago
2004
ACM
Prior work has shown that semantic email processes (SEPs) can be an effective tool for automating emailmediated tasks that are currently performed manually in a tedious, time-cons...
SWAT
1998
Springer
13 years 9 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
CP
2007
Springer
13 years 11 months ago
2007
Springer
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
KBSE
1999
IEEE
13 years 9 months ago
1999
IEEE
Many domain specialists are not familiar or comfortable with formal notations and formal tools like theorem provers or model generators. To address this problem we developed Attem...