Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Authors' response to "an addendum on the incremental assignment problem" by Volgenant
Date
2008-12-01
Author
Toroslu, İsmail Hakkı
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
51
views
0
downloads
Cite This
Subject Keywords
Control and Systems Engineering
,
Theoretical Computer Science
,
Software
,
Information Systems and Management
,
Artificial Intelligence
,
Computer Science Applications
URI
https://hdl.handle.net/11511/35843
Journal
INFORMATION SCIENCES
DOI
https://doi.org/10.1016/j.ins.2008.07.021
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
Semantic information-based alternative plan generation for multiple query optimization
Polat, Faruk; Alhajj, R (Elsevier BV, 2001-09-01)
This paper addresses the impact of semantic information about queries on alternative plan generation (APG) for multiple query optimization (MQO). MQO covers optimizing the execution of a set of queries together where each query in the set to be optimized has several alternative execution plans. A multiple query optimizer selects an alternative plan for each query to obtain an optimal global execution plan. Our approach uses information such as common relations, common possible joins and common conditions to...
Strategy creation, decomposition and distribution in particle navigation
Beldek, Ulas; Leblebicioğlu, Mehmet Kemal (Elsevier BV, 2007-02-01)
Strategy planning is crucial to control a group to achieve a number of tasks in a closed area full of obstacles. In this study, genetic programming has been used to evolve rule-based hierarchical structures to move the particles in a grid region to accomplish navigation tasks. Communications operations such as receiving and sending commands between particles are also provided to develop improved strategies. In order to produce more capable strategies, a task decomposition procedure is proposed. In addition,...
A dynamic programming algorithm for tree-like weighted set packing problem
Gulek, Mehmet; Toroslu, İsmail Hakkı (Elsevier BV, 2010-10-15)
In hierarchical organizations, hierarchical structures naturally correspond to nested sets. That is, we have a collection of sets such that for any two sets, either one of them is a subset of the other, or they are disjoint. In other words, a nested set system forms a hierarchy in the form of a tree structure. The task assignment problem on such hierarchical organizations is a real life problem. In this paper, we introduce the tree-like weighted set packing problem, which is a weighted set packing problem r...
Spatio-temporal querying in video databases
Koprulu, M; Cicekli, NK; Yazıcı, Adnan (Elsevier BV, 2004-03-22)
A video data model that supports spatio-temporal querying in videos is presented. The data model is focused on the semantic content of video streams. Objects, events, activities, and spatial properties of objects are main interests of the model. The data model enables the user to query fuzzy spatio-temporal relationships between video objects and also trajectories of moving objects. A prototype of the proposed model has been implemented.
An access structure for similarity-based fuzzy databases
Yazıcı, Adnan (Elsevier BV, 1999-04-01)
A significant effort has been made in representing imprecise information in database models by using fuzzy set theory. However, the research directed toward access structures to handle fuzzy querying effectively is still at an immature stage. Fuzzy querying involves more complex processing than the ordinary querying does. Additionally, a larger number of tuples are possibly selected by fuzzy conditions in comparison to the crisp ones. It is obvious that the need for fast response time becomes very important...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
İ. H. Toroslu, “Authors’ response to “an addendum on the incremental assignment problem” by Volgenant,”
INFORMATION SCIENCES
, pp. 4584–4584, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35843.