Sciweavers

1329 search results - page 38 / 266
» Models and solution techniques for frequency assignment prob...
Sort
View
FPL
2000
Springer
103views Hardware» more  FPL 2000»
15 years 3 months ago
Evaluation of Accelerator Designs for Subgraph Isomorphism Problem
Many applications can be modeled as subgraph isomorphism problems. However, this problem is generally NP-complete and difficult to compute. A custom computing circuit is a prospect...
Shuichi Ichikawa, Hidemitsu Saito, Lerdtanaseangth...
AIPS
2009
15 years 29 days ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
SAC
2000
ACM
15 years 3 months ago
An Approach for Modeling the Name Lookup Problem in the C++ Programming Language
Abstract. Formal grammars are well established for specifying the syntax of programming languages. However, the formal specification of programming language semantics has proven mo...
James F. Power, Brian A. Malloy
JSAC
2010
170views more  JSAC 2010»
14 years 6 months ago
Anti-jamming broadcast communication using uncoordinated spread spectrum techniques
Jamming-resistant communication is crucial for safety-critical applications such as emergency alert broadcasts or the dissemination of navigation signals in adversarial settings. I...
Christina Pöpper, Mario Strasser, Srdjan Capk...
CORR
1999
Springer
98views Education» more  CORR 1999»
14 years 11 months ago
A variational description of the ground state structure in random satisfiability problems
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
Giulio Biroli, Rémi Monasson, Martin Weigt