14158 search results - page 474 / 2832 » Generalized switch-setting problems |
187
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
160
click to vote
IBERAMIA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
167
click to vote
CEC
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
145
click to vote
ASPDAC
1999
ACM
15 years 10 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
149
click to vote
ECAI
1994
Springer
15 years 10 months ago
1994
Springer
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations s...