Sciweavers

Share
JUCS
2008
132views more  JUCS 2008»
8 years 10 months ago
Testing Website Usability in Spanish-Speaking Academia through Heuristic Evaluation and Cognitive Walkthroughs
: Although usability evaluations have been focused on assessing different contexts of use, no proper specifications have been addressed towards the particular environment of academ...
María Paula González, Toni Granoller...
JAIR
2006
102views more  JAIR 2006»
8 years 10 months ago
Multiple-Goal Heuristic Search
This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
Dmitry Davidov, Shaul Markovitch
JAIR
2006
179views more  JAIR 2006»
8 years 10 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
JAL
2008
97views more  JAL 2008»
8 years 10 months ago
Experimental studies of variable selection strategies based on constraint weights
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
Richard J. Wallace, Diarmuid Grimes
COR
2007
134views more  COR 2007»
8 years 10 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez
EOR
2006
44views more  EOR 2006»
8 years 10 months ago
The multiple-job repair kit problem
The repair kit problem is that of finding the optimal set of parts in the kit of a repairman. An important aspect of this problem, in many real-life situations, is that several jo...
Ruud H. Teunter
EOR
2006
57views more  EOR 2006»
8 years 10 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro
ENTCS
2006
136views more  ENTCS 2006»
8 years 10 months ago
Adaptive Application of SAT Solving Techniques
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
Ohad Shacham, Karen Yorav
COR
2006
86views more  COR 2006»
8 years 10 months ago
Heuristics for a bidding problem
In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-b...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu
HEURISTICS
2008
92views more  HEURISTICS 2008»
8 years 10 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
books