Open Problems Clause Samples

The "Open Problems" clause identifies and outlines issues or questions that remain unresolved within the context of an agreement, project, or document. Typically, this clause lists specific topics, tasks, or technical challenges that require further investigation, clarification, or decision-making, and may assign responsibility for addressing them or set deadlines for resolution. Its core practical function is to ensure transparency about outstanding matters, facilitate ongoing collaboration, and provide a structured approach to tracking and resolving uncertainties or pending items.
Open Problems. Our results leave a number of very exciting open problems.
View SourceView Similar (2)
Open Problems. The communication complexity of Optimal-ABA shows that the protocol is com- munication optimal for sufficiently large l and the bound on l depends on the communication complexity of the underlying ABA and AVSS protocols. One may try to design communication optimal ABA protocol for all values of l (if possible) using completely different approach.
View Source
Open Problems. An important open question is to investigate whether multi-valued communi- cation optimal protocols can be achieved with less number of invocations to protocols for single bit in comparison to what we provide in this paper. [ADH08] ▇. ▇▇▇▇▇▇▇, ▇. ▇▇▇▇▇, and ▇. ▇. ▇▇▇▇▇▇▇. An almost-surely terminating polynomial protocol for asynchronous Byzantine Agreement with optimal resilience. In PODC, pages 40†–414. ACM Press, 2008. [BGP09] ▇. ▇▇▇▇▇▇, G. A. ▇▇▇▇▇, and ▇. ▇. ▇▇▇▇▇. Bit optimal distributed consensus. In Computer Science Research, 2009. [BKR94] ▇. ▇▇▇▇▇, ▇. ▇▇▇▇▇▇, and ▇. ▇▇▇▇▇. Asynchronous secure computations with optimal resilience. In PODC, pages 183–192. ACM Press, 1994. [BO83] M. Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols. In PODC, pages 2k–30. ACM Press, 1983. [BOCG93] ▇. ▇▇▇-Or, ▇. ▇▇▇▇▇▇▇, and ▇. ▇▇▇▇▇▇▇▇▇. Asynchronous Secure Compu- tation. In STOC, pages †2–61. ACM Press, 1993. [BOGW88] M. Ben-Or, ▇. ▇▇▇▇▇▇▇▇▇▇, and ▇. ▇▇▇▇▇▇▇▇▇. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended ab- stract). In STOC, pages 1–10. ACM Press, 1988. [Bra84] ▇. ▇▇▇▇▇▇. An asynchronous |(ı — 1)ƒ3∫-resilient consensus protocol. In [BTH06] Z. Beerliov´a-Trub´ıniov´a and ▇. ▇▇▇▇. Efficient multi-party computation with dispute control. In TCC, LNCS 38k6, pages 30†–328, 2006. [Can9†] ▇. ▇▇▇▇▇▇▇. Sfudses sn Secuve Mu1fspavfy Compufafson and App1scafsons. PhD thesis, Weizmann Institute, Israel, 199†. [CGMA8†] B. Chor, ▇. ▇▇▇▇▇▇▇▇▇▇, ▇. ▇▇▇▇▇▇, and ▇. ▇▇▇▇▇▇▇▇. Verifiable secret shar- ing and achieving simultaneity in the presence of faults (extended abstract). In STOC, pages 383–39†. ACM Press, 198†. [CR93] ▇. ▇▇▇▇▇▇▇ and ▇. ▇▇▇▇▇. Fast asynchronous Byzantine Agreement with optimal resilience. In STOC, pages 42–†1. ACM Press, 1993. [CW92] ▇. ▇. ▇▇▇▇ and ▇. ▇. ▇▇▇▇▇. Modular construction of a Byzantine Agree- ment protocol with optimal message bit complexity. Infovmafson and Com− pufafson, 9k(1):61–8†, 1992. [DR8†] ▇. ▇▇▇▇▇ and ▇. ▇▇▇▇▇▇▇▇. Bounds on information exchange for Byzantine Agreement. JACM, 32(1):191–204, 198†. [FH06] ▇. ▇▇▇▇▇ and ▇. ▇▇▇▇. Optimally Efficient Multi-valued Byzantine Agree- ment. In PODC, pages 163–168, 2006. [FLP8†] ▇. ▇. ▇▇▇▇▇▇▇, ▇. ▇. ▇▇▇▇▇, and ▇. ▇▇▇▇▇▇▇▇. Impossibility of distributed consensus with one faulty process. JACM, 32(2):3k4–382, 198†. [FM88] ▇. ▇▇▇▇▇▇▇ and ▇. ▇▇▇▇▇▇. An Optimal Algorithm for Synchronous Byzan- ▇▇▇▇ ▇▇▇▇▇▇▇▇. In STOC, pages 639–648....
View Source

Related to Open Problems

  • Problems To endeavour to resolve in a fair and just manner any problems, grievances or difficulties which may be encountered while you volunteer with us;

  • Problem Solving Employees and supervisors are encouraged to attempt to resolve on an informal basis, at the earliest opportunity, a problem that could lead to a grievance. If the matter is not resolved by informal discussion, or a problem-solving meeting does not occur, it may be settled in accordance with the grievance procedure. Unless mutually agreed between the Employer and the Union problem-solving discussions shall not extend the deadlines for filing a grievance. The Union ▇▇▇▇▇▇▇ or in their absence, the Local Union President, or Area ▇▇▇▇▇▇▇, or Chief ▇▇▇▇▇▇▇, either with the employee or alone, shall present to the appropriate supervisor a written request for a meeting. If the supervisor agrees to a problem- solving meeting, this meeting shall be held within fourteen (14) calendar days of receipt of the request. The supervisor, employee, Union ▇▇▇▇▇▇▇, and up to one (1) other management person shall attempt to resolve the problem through direct and forthright communication. If another member of management is present that person will not be hearing the grievance at Step Two, should it progress to that Step. The employee, the Union ▇▇▇▇▇▇▇ or in their absence, the Local Union President, or Area ▇▇▇▇▇▇▇, or Chief ▇▇▇▇▇▇▇, may participate in problem-solving activities on paid time, in accordance with Article 31, Union Rights, Section 1H.

  • Year 2000 Problem The Company and its Subsidiaries have reviewed the areas within their business and operations which could be adversely affected by, and have developed or are developing a program to address on a timely basis, the "Year 2000 Problem" (that is, the risk that computer applications used by the Company and its Subsidiaries may be unable to recognize and perform properly date-sensitive functions involving certain dates prior to and any date after December 31, 1999). Based on such review and program, the Company reasonably believes that the "Year 2000 Problem" will not have a Material Adverse Effect.

  • Virus Detection You will be responsible for the installation and proper use of any virus detection/scanning program we require from time to time.

  • Loop Testing/Trouble Reporting 2.1.6.1 Telepak Networks will be responsible for testing and isolating troubles on the Loops. Telepak Networks must test and isolate trouble to the BellSouth portion of a designed/non-designed unbundled Loop (e.g., UVL-SL2, UCL-D, UVL-SL1, UCL-ND, etc.) before reporting repair to the UNE Customer Wholesale Interconnection Network Services (CWINS) Center. Upon request from BellSouth at the time of the trouble report, Telepak Networks will be required to provide the results of the Telepak Networks test which indicate a problem on the BellSouth provided Loop. 2.1.6.2 Once Telepak Networks has isolated a trouble to the BellSouth provided Loop, and had issued a trouble report to BellSouth on the Loop, BellSouth will take the actions necessary to repair the Loop if a trouble actually exists. BellSouth will repair these Loops in the same time frames that BellSouth repairs similarly situated Loops to its End Users. 2.1.6.3 If Telepak Networks reports a trouble on a non-designed or designed Loop and no trouble actually exists, BellSouth will charge Telepak Networks for any dispatching and testing (both inside and outside the CO) required by BellSouth in order to confirm the Loop’s working status. 2.1.6.4 In the event BellSouth must dispatch to the end-user’s location more than once due to incorrect or incomplete information provided by Telepak Networks (e.g., incomplete address, incorrect contact name/number, etc.), BellSouth will ▇▇▇▇ ▇▇▇▇▇▇▇ Networks for each additional dispatch required to repair the circuit due to the incorrect/incomplete information provided. BellSouth will assess the applicable Trouble Determination rates from BellSouth’s FCC or state tariffs.