Sciweavers

5924 search results - page 1167 / 1185
» Normal Process Representatives
Sort
View
CORR
2002
Springer
105views Education» more  CORR 2002»
13 years 7 months ago
Effectiveness of Preference Elicitation in Combinatorial Auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm
JSA
2000
175views more  JSA 2000»
13 years 7 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
PRESENCE
2000
92views more  PRESENCE 2000»
13 years 7 months ago
Virtual Explorer: Interactive Virtual Environment for Education
The Virtual Explorer project of the Senses Bureau at the University of California, San Diego, focuses on creating immersive, highly interactive environments for education and scie...
Kevin L. Dean, Xyler S. Asay-Davis, Evan M. Finn, ...
CACM
1998
103views more  CACM 1998»
13 years 7 months ago
The Virtual Design Team
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
John C. Kunz, Tore R. Christiansen, Geoff P. Cohen...
AMAI
1999
Springer
13 years 7 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
« Prev « First page 1167 / 1185 Last » Next »