4123 search results - page 654 / 825 » Multiple Relational Embedding |
164
click to vote
SIGECOM
2000
ACM
15 years 10 months ago
2000
ACM
Supply chain formation presents difficult coordination issues for distributed negotiation protocols. Agents must simultaneously negotiate production relationships at multiple lev...
203
click to vote
ADC
2000
Springer
15 years 10 months ago
2000
Springer
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
179
click to vote
ECAI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
149
click to vote
ARITH
1999
IEEE
15 years 10 months ago
1999
IEEE
Although division is less frequent than addition and multiplication, because of its longer latency it dissipates a substantial part of the energy in floating-point units. In this ...
157
click to vote
IUI
1999
ACM
15 years 10 months ago
1999
ACM
In next-generation virtual 3D simulation, training, and entertainment environments, intelligent visualization interfaces must respond to user-specified viewing requests so users c...