The following pages link to Jacek Błażewicz (Q224835):
Displaying 26 items.
- A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
- Scheduling independent 2-processor tasks to minimize schedule length (Q796987) (← links)
- Evolutionary approaches to DNA sequencing with errors (Q817123) (← links)
- A note on the two machine job shop with the weighted late work criterion (Q880589) (← links)
- Dealing with repetitions in sequencing by hybridization (Q883811) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- Modeling the process of human body iron homeostasis using a variant of timed Petri nets (Q1026173) (← links)
- Dynamic storage allocation with limited compaction - complexity and some practical implications (Q1058288) (← links)
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1186309) (← links)
- Deadline scheduling of tasks with ready times and resource constraints (Q1255432) (← links)
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (Q1261479) (← links)
- On the recognition of de Bruijn graphs and their induced subgraphs (Q1348115) (← links)
- Distributed processing of divisible jobs with communication startup costs (Q1363737) (← links)
- Scheduling multiprocessor tasks on parallel processors with limited availability. (Q1399581) (← links)
- Complexity of DNA sequencing by hybridization. (Q1401172) (← links)
- Linear and quadratic algorithms for scheduling chains and opposite chains (Q1600834) (← links)
- On some properties of DNA graphs (Q1961230) (← links)
- Optimal pathway reconstruction on 3D NMR maps (Q2255053) (← links)
- ModeLang: a new approach for experts-friendly viral infections modeling (Q2262142) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125) (← links)
- Computational complexity of isothermic DNA sequencing by hybridization (Q2489897) (← links)
- A preemptive open shop scheduling problem with one resource (Q2641218) (← links)
- Internet shopping optimization problem (Q3587068) (← links)
- Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem (Q5439390) (← links)
- Auction protocols for decentralized scheduling (Q5938627) (← links)
