Sciweavers

1306 search results - page 159 / 262
» A Diagrammatic Approach to Model Completion
Sort
View
115
Voted
TAGT
1998
Springer
243views Graph Theory» more  TAGT 1998»
15 years 5 months ago
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
Hartmut Ehrig, Reiko Heckel, Mercè Llabr&ea...
ENDM
2006
69views more  ENDM 2006»
15 years 25 days ago
Timetabling problems at the TU Eindhoven
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
John van den Broek, Cor A. J. Hurkens, Gerhard J. ...
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
16 years 1 months ago
Web site mining: a new way to spot competitors, customers and suppliers in the world wide web
When automatically extracting information from the world wide web, most established methods focus on spotting single HTMLdocuments. However, the problem of spotting complete web s...
Martin Ester, Hans-Peter Kriegel, Matthias Schuber...
92
Voted
ICCD
2007
IEEE
124views Hardware» more  ICCD 2007»
15 years 9 months ago
Placement and routing of RF embedded passive designs in LCP substrate
Physical layout generation of RF embedded passive design is not an easy task since the response of a given layout is tightly coupled with the response of the individual components...
Mohit Pathak, Souvik Mukherjee, Madhavan Swaminath...
EMO
2009
Springer
174views Optimization» more  EMO 2009»
15 years 7 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck