952 search results - page 54 / 191 » Computational complexity of stochastic programming problems |
116
Voted
JAIR
2011
14 years 7 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
87
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
99
Voted
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
126
Voted
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
120
Voted
COMPULOG
1999
Springer
15 years 4 months ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...