Sciweavers

442 search results - page 25 / 89
» Discovering Heuristic Strategy for Solving Scheduling Proble...
Sort
View
VLDB
2001
ACM
90views Database» more  VLDB 2001»
15 years 6 months ago
Update Propagation Strategies for Improving the Quality of Data on the Web
Dynamically generated web pages are ubiquitous today but their high demand for resources creates a huge scalability problem at the servers. Traditional web caching is not able to ...
Alexandros Labrinidis, Nick Roussopoulos
121
Voted
CP
1998
Springer
15 years 6 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
WWW
2007
ACM
16 years 2 months ago
Compare&contrast: using the web to discover comparable cases for news stories
Comparing and contrasting is an important strategy people employ to understand new situations and create solutions for new problems. Similar events can provide hints for problem s...
Jiahui Liu, Earl Wagner, Larry Birnbaum
CEC
2007
IEEE
15 years 8 months ago
An investigation of hyper-heuristic search spaces
— Hyper-heuristics or “heuristics that coordinate heuristics” are fastly becoming popular for solving combinatorial optimisation problems. These methods do not search directl...
José Antonio Vázquez Rodrígue...
ICOIN
2005
Springer
15 years 7 months ago
RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, Hyunseu...