Sciweavers

1236 search results - page 69 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
CGF
2004
173views more  CGF 2004»
14 years 9 months ago
Simulating and Modeling Lichen Growth
This paper presents a system for modeling lichens and simulating their propagation and growth in a virtual scene. Lichens colonize almost every substrate in nature and play an imp...
Brett Desbenoit, Eric Galin, Samir Akkouche
COR
2007
95views more  COR 2007»
14 years 9 months ago
Inventory routing with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
ISMB
1994
14 years 11 months ago
An Efficient Method for Multiple Sequence Alignment
Multiple sequence alignment has been a useful methodin the study of molecular evolution and sequence-structure relationships. This paper presents a newmethodfor multiple sequence ...
Jin Kim, Sakti Pramanik
ML
2000
ACM
103views Machine Learning» more  ML 2000»
14 years 9 months ago
Phase Transitions in Relational Learning
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
Attilio Giordana, Lorenza Saitta