Sciweavers

CP
2005
Springer
13 years 10 months ago
Solving Simple Planning Problems with More Inference and No Search
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
Vincent Vidal, Hector Geffner
CP
2005
Springer
13 years 10 months ago
Probabilistic Arc Consistency
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
Deepak Mehta, Marc R. C. van Dongen
SIGDOC
2005
ACM
13 years 10 months ago
Usability over time
Testing of usability could perhaps be more accurately described as testing of learnability. We know more about the problems of novice users than we know of the problems of experie...
Valerie Mendoza, David G. Novick
AUIC
2006
IEEE
13 years 10 months ago
Usability evaluation of library online catalogues
We performed a usability evaluation of four New Zealand university online library catalogues. The evaluation found severe usability problems with online catalogues—we found so m...
Hayley White, Tim Wright, Brenda Chawner
TACAS
2007
Springer
118views Algorithms» more  TACAS 2007»
13 years 10 months ago
Checking Pedigree Consistency with PCS
Abstract. Many important problems in bioinformatics and genetics require analyses that are NP-complete. For example, one of the basic problems facing researchers that analyze pedig...
Panagiotis Manolios, Marc Galceran Oms, Sergi Oliv...
FSTTCS
2007
Springer
13 years 10 months ago
Covering Graphs with Few Complete Bipartite Subgraphs
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
Herbert Fleischner, Egbert Mujuni, Daniël Pau...
VL
2007
IEEE
13 years 11 months ago
Evaluating an Automated Tool to Assist Evolutionary Document Generation
While using how-to documents for guidance in performing computer-based tasks, users often run into problems due to inaccurate, out-of-date and incomplete documentation. These prob...
Gahgene Gweon, Lawrence D. Bergman, Vittorio Caste...
CEC
2007
IEEE
13 years 11 months ago
How well do multi-objective evolutionary algorithms scale to large problems
Abstract— In spite of large amount of research work in multiobjective evolutionary algorithms, most have evaluated their algorithms on problems with only two to four objectives. ...
Kata Praditwong, Xin Yao
SCIA
2009
Springer
183views Image Analysis» more  SCIA 2009»
13 years 11 months ago
Globally Optimal Least Squares Solutions for Quasiconvex 1D Vision Problems
Abstract. Solutions to non-linear least squares problems play an essential role in structure and motion problems in computer vision. The predominant approach for solving these prob...
Carl Olsson, Martin Byröd, Fredrik Kahl
IWPEC
2009
Springer
13 years 11 months ago
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
Gregory Gutin, Eun Jung Kim, Stefan Szeider, Ander...