Sciweavers

2747 search results - page 415 / 550
» Non-oblivious Strategy Improvement
Sort
View
COR
2006
98views more  COR 2006»
14 years 11 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
DSS
2006
129views more  DSS 2006»
14 years 11 months ago
IPManager: a microcomputer-based DSS for intellectual property management
We describe a decision support system (DSS) that was developed for the management of the costs associated with the payment of fees to protect the intellectual property (IP) of org...
Chuda B. Basnet, Les R. Foulds, Warren Parker
IJFCS
2008
98views more  IJFCS 2008»
14 years 11 months ago
On Succinct Representation of Knowledge Community Taxonomies with Formal Concept Analysis
We present an application of formal concept analysis aimed at representing a meaningful structure of knowledge communities in the form of a lattice-based taxonomy. The taxonomy gr...
Camille Roth, Sergei A. Obiedkov, Derrick G. Kouri...
CORR
2007
Springer
116views Education» more  CORR 2007»
14 years 11 months ago
Rate Bounds for MIMO Relay Channels Using Message Splitting
This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input singleoutput (SISO) relay ch...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...
JSAC
2008
136views more  JSAC 2008»
14 years 11 months ago
Fixed point opportunistic routing in delay tolerant networks
We propose in this work a single copy and multi-hop opportunistic routing scheme for sparse delay tolerant networks (DTNs). The scheme uses as only input the estimates of the avera...
Vania Conan, Jeremie Leguay, Timur Friedman