Sciweavers

3818 search results - page 268 / 764
» Word Problems on Compressed Words
Sort
View
FSTTCS
2006
Springer
15 years 10 months ago
One-Input-Face MPCVP Is Hard for L, But in LogDCFL
A monotone planar circuit (MPC) is a Boolean circuit that can be embedded in a plane, and that has only AND and OR gates. Yang showed that the one-input-face monotone planar circui...
Tanmoy Chakraborty, Samir Datta
DLOG
2008
15 years 9 months ago
A Survey of Revision Approaches in Description Logics
Abstract. Revision of a Description Logic-based ontology to incorporate newly received information consistently is an important problem for the lifecycle of ontologies. Many approa...
Guilin Qi, Fangkai Yang
WSC
2007
15 years 9 months ago
The range of predictions for calibrated agent-based simulation models
Agent-based simulation is increasingly used to study systems in many areas of business and science. Using agentbased simulation for prediction could be very valuable. However, the...
DongFang Shi, Roger J. Brooks
AIMSA
2008
Springer
15 years 8 months ago
A Hybrid Approach to Distributed Constraint Satisfaction
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
David Lee, Inés Arana, Hatem Ahriz, Kit-Yin...
SODA
1997
ACM
114views Algorithms» more  SODA 1997»
15 years 8 months ago
Better Approximation Guarantees for Job-shop Scheduling
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
Leslie Ann Goldberg, Mike Paterson, Aravind Sriniv...