Sciweavers

16596 search results - page 247 / 3320
» Generalized Assignment Problems
Sort
View
159
Voted
TIT
2011
119views more  TIT 2011»
15 years 1 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
205
Voted
CIKM
2007
Springer
16 years 26 days ago
Optimal proactive caching in peer-to-peer network: analysis and application
As a promising new technology with the unique properties like high efficiency, scalability and fault tolerance, Peer-toPeer (P2P) technology is used as the underlying network to b...
Weixiong Rao, Lei Chen 0002, Ada Wai-Chee Fu, Ying...
IJCNN
2006
IEEE
16 years 22 days ago
Patterns, Hypergraphs and Embodied General Intelligence
—It is proposed that the creation of Artificial General Intelligence (AGI) at the human level and ultimately beyond is a problem addressable via integrating computer science algo...
Ben Goertzel
WWW
2008
ACM
16 years 7 months ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari
203
Voted
WSNA
2003
ACM
15 years 12 months ago
Role-based hierarchical self organization for wireless ad hoc sensor networks
Efficiently self organizing a network hierarchy with specific assignment of roles (or tasks) to sensors based on their physical wireless connectivity and sensing characteristics ...
Manish Kochhal, Loren Schwiebert, Sandeep K. S. Gu...