Sciweavers

2356 search results - page 283 / 472
» Characterizations of postman sets
Sort
View
JAIR
2008
109views more  JAIR 2008»
15 years 6 months ago
Modular Reuse of Ontologies: Theory and Practice
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...
CORR
2007
Springer
95views Education» more  CORR 2007»
15 years 6 months ago
A Note on the Periodicity and the Output Rate of Bit Search Type Generators
We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two ...
Yucel Altug, N. Polat Ayerden, Mehmet Kivanç...
DAM
2007
100views more  DAM 2007»
15 years 6 months ago
Partially ordered knapsack and applications to scheduling
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
Stavros G. Kolliopoulos, George Steiner
JTAER
2008
200views more  JTAER 2008»
15 years 6 months ago
Exploring Relationships between Products Characteristics and B2C Interaction in Electronic Commerce
The main purpose of the paper is to explore and discuss the influence of product type on customer interaction in electronic commerce. We have conducted two qualitative case studie...
Karin Axelsson
JSAC
2006
107views more  JSAC 2006»
15 years 6 months ago
Efficiency and Braess' Paradox under pricing in general networks
We study the flow control and routing decisions of self-interested users in a general congested network where a single profit-maximizing service provider sets prices for different ...
Xin Huang, Asuman E. Ozdaglar, Daron Acemoglu