Sciweavers

11573 search results - page 2009 / 2315
» Designing Relational Databases
Sort
View
153
Voted
ICTAI
1997
IEEE
15 years 8 months ago
Toward the Optimization of a Class of Black Box Optimization Algorithms
Many black box optimization algorithms have sufcient exibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) ...
Gang Wang, Erik D. Goodman, William F. Punch III
CHI
1997
ACM
15 years 8 months ago
Revisitation Patterns in World Wide Web Navigation
In this paper, we report on users' revisitation patterns to World Wide Web (WWW) pages, and use the results to lay an empirical foundation for the design of history mechanism...
Linda Tauscher, Saul Greenberg
COMPGEOM
1997
ACM
15 years 8 months ago
Realistic Input Models for Geometric Algorithms
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
Mark de Berg, Matthew J. Katz, A. Frank van der St...
UIST
1997
ACM
15 years 8 months ago
Solving Linear Arithmetic Constraints for User Interface Applications
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring th...
Alan Borning, Kim Marriott, Peter J. Stuckey, Yi X...
HICSS
1996
IEEE
123views Biometrics» more  HICSS 1996»
15 years 8 months ago
Concurrency: A Case Study in Remote Tasking and Distributed IPC
Remote tasking encompasses different functionality, such as remote forking, multiple remote spawning, and task migration. In order to overcome the relatively high costs of these m...
Dejan S. Milojicic, Alan Langerman, David L. Black...
« Prev « First page 2009 / 2315 Last » Next »