Sciweavers

2208 search results - page 141 / 442
» On Issues of Instance Selection
Sort
View
98
Voted
AAAI
1998
15 years 5 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
167
Voted
IADT
1998
146views more  IADT 1998»
15 years 5 months ago
An Open Architecture for Adaptive Workflow Management Systems
One of the main tasks of workflow management systems is the coordination of activities in business processes. This paper introduces a solution framework to support adaptive workfl...
Reiner Siebert
115
Voted
HM
2010
Springer
133views Optimization» more  HM 2010»
15 years 4 months ago
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...
Luca Di Gaspero, Johannes Gärtner, Nysret Mus...
120
Voted
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 3 months ago
Context Ontology Implementation for Smart Home
Context awareness is one of the important fields in ubiquitous computing. Smart Home, a specific instance of ubiquitous computing, provides every family with opportunities to enjo...
Tam Van Nguyen, Wontaek Lim, Huy Anh Nguyen, Deokj...
125
Voted
DISOPT
2008
85views more  DISOPT 2008»
15 years 3 months ago
How tight is the corner relaxation?
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
Matteo Fischetti, Michele Monaci