Sciweavers

16843 search results - page 96 / 3369
» On Generalized Authorization Problems
Sort
View
SIAMDM
2008
77views more  SIAMDM 2008»
13 years 8 months ago
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
Angel Corberán, Isaac Plana, José M....
CHI
2009
ACM
14 years 27 days ago
The problem of consistency in the design of Fitts' law experiments: consider either target distance and width or movement form a
An intriguing anomaly of the usual way of designing Fitts’ law experiments in experimental psychology and HCI is exposed: experiments are traditionally designed so as to careful...
Yves Guiard
BICOB
2009
Springer
14 years 2 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...
SAT
2004
Springer
101views Hardware» more  SAT 2004»
14 years 1 months ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
EOR
2006
139views more  EOR 2006»
13 years 8 months ago
A critical-shaking neighborhood search for the yard allocation problem
The yard allocation problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). As the problem is NP-hard, we propose an effective met...
Andrew Lim, Zhou Xu