Yayın: A Path Selection Based Algorithm for Maximizing Self-satisfiability of Requests in Real-Time Grid Applications
| dc.contributor.author | Mohammed Eltayeb | |
| dc.contributor.author | Doğan, Atakan | |
| dc.contributor.author | Atakan Doğan | |
| dc.contributor.author | F. Özgüner | |
| dc.contributor.orcid | 0000-0002-1117-9689 | |
| dc.date.accessioned | 2025-11-13T21:26:42Z | |
| dc.date.issued | 2004-01-01 | |
| dc.identifier.doi | https://doi.org/10.1007/978-3-540-27866-5_61 | |
| dc.identifier.endpage | 475 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.openalex | W1602618095 | |
| dc.identifier.startpage | 468 | |
| dc.identifier.uri | https://hdl.handle.net/11421/13448 | |
| dc.identifier.uri | https://doi.org/10.1007/978-3-540-27866-5_61 | |
| dc.language.iso | en | |
| dc.relation.ispartof | Lecture notes in computer science | |
| dc.rights | openAccess | |
| dc.subject | Computer science | |
| dc.subject | Satisfiability | |
| dc.subject | Grid | |
| dc.subject | Scheduling (production processes) | |
| dc.subject | Path (computing) | |
| dc.subject | Algorithm | |
| dc.subject | Distributed computing | |
| dc.subject | Time complexity | |
| dc.subject | Grid computing | |
| dc.subject | Heuristic | |
| dc.subject | Mathematical optimization | |
| dc.subject | Artificial intelligence | |
| dc.title | A Path Selection Based Algorithm for Maximizing Self-satisfiability of Requests in Real-Time Grid Applications | |
| dc.type | book-chapter | |
| dspace.entity.type | Publication | |
| local.authorid.openalex | A5070030139 |
