9842 search results - page 401 / 1969 » The Complexity of the Matching-Cut Problem |
149
Voted
ESANN
2007
15 years 6 months ago
2007
Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...
120
click to vote
INTERACT
2007
15 years 6 months ago
2007
This paper investigates novel ways to direct computers by eye gaze. Instead of using fixations and dwell times, this work focuses on eye motion, in particular gaze gestures. Gaze g...
120
click to vote
FLAIRS
2001
15 years 5 months ago
2001
This paper describes the implementationof a decision support systemthat helps non-technicalfront-line reception staff handle complex enquiries on a wide range of local government ...
120
click to vote
WSC
1998
15 years 5 months ago
1998
We present a new technique (RIIPS) for solving rostering problems in the presence of service uncertainty. RIIPS stands for "Rostering by Iterating Integer Programming and Sim...
128
click to vote
IPL
2008
15 years 4 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...