Sciweavers

3433 search results - page 450 / 687
» Heuristics for a bidding problem
Sort
View
CG
2005
Springer
15 years 6 months ago
A polar-plane-based method for natural illumination of plants and trees
We introduce an illumination method for outdoor scenes containing plants and trees. Our method supports multiresolution plant and tree models based on random L-systems. The method...
Maria J. Vicent, Vicente Rosell, Roberto Viv&oacut...
JOLLI
2007
128views more  JOLLI 2007»
15 years 6 months ago
Linear temporal logic as an executable semantics for planning languages
This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, PDDL-K (Planning...
Marta Cialdea Mayer, Carla Limongelli, Andrea Orla...
JSAC
2007
77views more  JSAC 2007»
15 years 6 months ago
Generalized wavelength sharing policies for absolute QoS guarantees in OBS networks
— We consider the problem of supporting absolute QoS guarantees in terms of the end-to-end burst loss in OBS networks. We present a parameterized model for wavelength sharing whi...
Li Yang, George N. Rouskas
ET
2002
105views more  ET 2002»
15 years 6 months ago
An Integrated Framework for the Design and Optimization of SOC Test Solutions
We propose an integrated framework for the design of SOC test solutions, which includes a set of algorithms for early design space exploration as well as extensive optimization for...
Erik Larsson, Zebo Peng
179
Voted
COMCOM
1999
91views more  COMCOM 1999»
15 years 6 months ago
Group-oriented undeniable signature schemes with a trusted center
Undeniable signature is an intriguing concept introduced by Chaum and Antwerpen at Crypto'89. In 1999, Lee and Hwang presented two group-oriented undeniable signature schemes ...
Narn-Yih Lee, Tzonelih Hwang