Sciweavers

16596 search results - page 2860 / 3320
» Generalized Assignment Problems
Sort
View
IJISEC
2007
119views more  IJISEC 2007»
15 years 6 months ago
An incentive compatible reputation mechanism for ubiquitous computing environments
The vision of ubiquitous computing is becoming a reality thanks to the advent of portable devices and the advances in wireless networking technologies. It aims to facilitate user ...
Jinshan Liu, Valérie Issarny
BMCBI
2005
162views more  BMCBI 2005»
15 years 6 months ago
Accelerated probabilistic inference of RNA structure evolution
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Ian Holmes
CCR
2005
76views more  CCR 2005»
15 years 6 months ago
Simplifying the synthesis of internet traffic matrices
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
Matthew Roughan
JSC
2007
79views more  JSC 2007»
15 years 6 months ago
Computation of bases of free modules over the Weyl algebras
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
Alban Quadrat, Daniel Robertz
AI
2002
Springer
15 years 6 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
« Prev « First page 2860 / 3320 Last » Next »