Sciweavers

1749 search results - page 268 / 350
» Conditional colorings of graphs
Sort
View
AAAI
1994
15 years 7 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
CORR
2007
Springer
121views Education» more  CORR 2007»
15 years 6 months ago
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signiï...
Salim Y. El Rouayheb, Mohammad Asad R. Chaudhry, A...
MONET
2006
107views more  MONET 2006»
15 years 6 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao
PAMI
2006
135views more  PAMI 2006»
15 years 6 months ago
Real-Time Range Acquisition by Adaptive Structured Light
The goal of this paper is to provide a "self-adaptive" system for real-time range acquisition. Reconstructions are based on a single frame structured light illumination. ...
Thomas P. Koninckx, Luc J. Van Gool
AI
2004
Springer
15 years 6 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao