12783 search results - page 402 / 2557 » Experimenting with computing |
156
click to vote
ORL
2006
15 years 6 months ago
2006
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
140
click to vote
ENDM
2010
15 years 4 months ago
2010
This paper addresses the jobshop and the flowshop scheduling problems with minimum and maximum time lags. To solve this kind of problems, we propose adaptations of Climbing Discre...
187
click to vote
ENDM
2010
15 years 1 months ago
2010
In this paper we show and discuss a family of inequalities for solving a variant of the classical vehicle routing problem where also a lower bound is considered. The inequalities ...
147
click to vote
MOBIQUITOUS
2005
IEEE
16 years 9 days ago
2005
IEEE
Applications designed for ubiquitous computing environments need to be coded in a specific way in order to fully realize the benefits of ubiquitous computing. Currently, applicati...
189
click to vote
CHI
2004
ACM
16 years 7 months ago
2004
ACM
Users of modern GUIs routinely engage in visual searches for various control items, such as buttons and icons. Because this is so ubiquitous, it is important that the visual prope...